I have some questions about this complexity, what base is used in this logarithm, 2 or 10? it's because? Looking at google I saw some comments saying that the base did not matter .. Is the logarithm deeply linked to this complexity or is it used only to give an idea of how little complexity grows as n
increases?
Last question, knowing only that while n
grows exponentially, the search grows only linearly, would it be enough to understand all other cases of complexity involving logarithm?