Binary Search

Binary search is a simple algorithm for finding an element in a sorted array in $O(log\; n)$ time, where $n$ is the length of the array. The approach is as simple as this: check the value of the midpoint of the array. If it's value

1. Check the value of the midpoint element of the array.
2. If it's value is greater than the value of the element we're looking for, we now know which half of the array the value will be in.
3. Access the value of the midpoint element of that half of the array.
4. If it's value is greater than the value of the element we're looking for, we now know whic quadrant of the array the value will be in.
5. Access the value of the midpoint element of that quadrant of the array.
6. And so on and so forth until the element is found.