##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Why log n is fast
Logarithmic growth is much slower than linear growth. If , then . Linear search takes a million steps, binary search takes .
Doubling from to increases linear time by , but only increases logarithmic time by (from to ).
This is why algorithms scale so well to huge inputs. Even with billions of elements, binary search takes fewer than steps.
