Searching Sorted Data

Binary search

The method we used for guessing a number is known as binary search. Perhaps the most important application of binary search is searching sorted data.

Searching sorted data

Searching is a fundamental problem. Given a sequence and an element $x$, we would like to check whether $x$ is present in this sequence. For example, $3$ is present in the sequence $(7,2,5,6,11,3,2,9)$ and $4$ is not present in this sequence. Given the importance of the search problem, it is not surprising that Python has built-in methods for solving it.