##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
What you learned
Binary search works on any monotonic property (here: sorted order), not just exact matches.
The pointer after binary search points to the first position where the condition holds.
Every halving step reduces the problem by a factor of , giving time regardless of whether you find an exact match.
