##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
What to watch out for
Confusing with . The latter is much smaller (double logarithm) and appears in advanced data structures like van Emde Boas trees.
Forgetting that , not . Logarithms turn multiplication into addition.
Assuming means the algorithm divides the input. Not always. Sometimes the input size is fixed but the value range is halved (like binary search on values).
