mirror of
https://github.com/onyx-and-iris/grokking-algorithms.git
synced 2025-11-04 06:21:46 +00:00
Binary Search
Repeatedly split the array checking if value is greater or less than the mid point. Stop when the exact value is found.
It takes log N steps to reduce an array of size N to an array of size 1. Time complexity for this algorithm is O(log N).