##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
All logarithms are equivalent
In Big-O notation, we write without specifying the base. Why? Because changing the base only multiplies by a constant.
From the change of base formula: . The factor is constant, and Big-O ignores constants.
So when you see in algorithm analysis, the base is usually (because of binary splits), but it doesn't matter for asymptotic analysis.
