previous
|
start
|
next
Binary Search
Locates a value in a sorted array by
Determining whether the value occurs in the first or second half
Then repeating the search in one of the halves
previous
|
start
|
next