Question

There are 1,000,000 entries in an index. A binary search on this

list would require how many steps?

Answer 1

To put that in perspective, binary search on an array with 1,000,000 elements only takes about 20 steps to find what you're looking for, because log_2(1,000,000) = 19.9 .