onyx_online/grokking-algorithms
1
0
Fork 0
mirror of https://github.com/onyx-and-iris/grokking-algorithms.git synced 2024-09-27 11:07:03 +01:00
Code Issues Packages Projects Releases Wiki Activity
master
grokking-algorithms/chapter1/README.md
onyx-and-iris 3fe14b8ac0 clean up repo. 
add more notes
2024-02-06 21:53:17 +00:00

261 B
Raw Permalink Blame History

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).