Binary Search Algorithm
In computer science, a binary search or half-interval search algorithm finds the position of a specified value (the input "key") within a sorted array. In each step, the algorithm compares the input key value with the key value of the middle element of the array. If the keys match, then a matching element has been found so its index, or position, is returned. Otherwise, if the sought key is less than the middle element's key, then the algorithm repeats its action on the sub-array to the left of the middle element or, if the input key is greater, on the sub-array to the right. If the remaining array to be searched is reduced to zero, then the key cannot be found in the array and a special "Not found" indication is returned.
A binary search halves the number of items to check with each iteration, so locating an item (or determining its absence) takes logarithmic time. A binary search is a dichotomic divide and conquer search algorithm.
Read more about Binary Search Algorithm: Overview, Performance, Variations, Implementation Issues, Language Support
Famous quotes containing the word search:
“We spent them not in toys, in lusts, or wine,
But search of deep Philosophy,
Wit, Eloquence, and Poetry,
Arts which I loved, for they, my Friend, were thine.”
—Abraham Cowley (1618–1667)