onyx_online/grokking-algorithms
1
0
Fork 0
mirror of https://github.com/onyx-and-iris/grokking-algorithms.git synced 2025-04-01 19:23:52 +01:00
Code Issues Packages Projects Releases Wiki Activity
grokking-algorithms/chapter_01
History
onyx-and-iris 7e44b37850 remove print numbers
2025-03-26 01:29:03 +00:00
..
binary.py
remove print numbers
2025-03-26 01:29:03 +00:00
README.md
reorganise directories
2025-03-26 01:27:35 +00:00

README.md

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