mirror of
https://github.com/onyx-and-iris/grokking-algorithms.git
synced 2024-09-27 11:07:03 +01:00
6 lines
261 B
Markdown
6 lines
261 B
Markdown
|
# 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)`.
|