binary search, also known as half-interval search or logarithmic search, is a search algorithm that finds the position of a target value within a sorted array. It compares the target value to the middle element of the array; if they are unequal, the half in which the target cannot lie is eliminated and the search continues on the remaining half until it is successful.
Home
Archives for August 2016
Wednesday, August 31, 2016
Monday, August 8, 2016
Subscribe to:
Posts (Atom)