The binary logarithm is the most common logarithm in computer science. It tells you how many times you can divide by before reaching .
For example, . You can halve six times: . Each division is one step, so six divisions means .
This is why binary search runs in time. Each comparison cuts the search space in half, and you can only halve about times before you find your answer.