Section 22.3 Bisection Search
As you have seen, Linear Search (also called sequential search) is a very simple algorithm, for which the data to be searched can be in any order. But… the algorithm is not very efficient. Imagine looking for a name in a phone book that hasn’t been sorted alphabetically…
If your data is sorted, then there is a much more efficient algorithm called Bisection Search that you can use to look for an item in your list.
If you cannot see this codecast, please click here.

