1. The problem statement, all variables and given/known data Hello! I have just heard in one online lecture that if for example there is a phone book with 4 billion entries (or a data set with 4 billion entries), then to find one entry (for example, Kim Simth) I need maximum 32 steps. If the amount of entries is increased by half, ie to 8 biliion, then it's ll take 33 steps. I understand the algorithm of how to do binary search (divide by half, by half, etc). But I have no clue on how to compute the math behind those 32 steps, and how log(n) works in this case. Please, help me with your advice on how to learn this, what are good resources on this matter, where to read about it (not in Wikipedia, sorry). Thank you very much!