Anonymous user
Binary search: Difference between revisions
m
Added to recursion category
No edit summary |
m (Added to recursion category) |
||
Line 1:
{{task}}[[Category:Recursion]]
A binary search divides a range of values into halves, and continues to narrow down the field of search until the unknown value is found. It is the classic example of a "divide and conquer" algorithm.
| |||