Sorting and Searching

Binary Search

Now search for an item in a data sequence that has been previously sorted.
Rather than a linear search, we will do a binary search.
The search is called binary because the size of the search area is cut in half in each step.
The cutting in half works only because the sequence of values has been sorted.