Binary search

A searching algorithm that uses a file in which the sort key are in ascending order. The middle key in the file is examined and, depending upon whether this is less than or greater than the desired key, the top or bottom part of the file is again examined. Continuing in this way the algorithm either finds the desired record or discovers its absence from the file. Thus the algorithm treats the file is though it were a binary search tree.

Clicking on this step you can see the Create code learningstep of the algorithm.