I found this quite interesting. Basically, given the following description: Binary search solves the problem [of searching within a pre-sorted array] by keeping track of a range within the array in ...

It is called binary because it splits the array into two halves as part of the algorithm. Initially, a binary search will look at the item in the middle of the array and compare it to the search terms ...