The Binary Search Algorithm is used to locate the position
of a name in a list of names in alphabetical order.
- find the midpoint of the list and compare with the
required item
- if they match then stop
- if the required item occurs before the midpoint
then discard the bottom half of the list if the required item occurs after the
midpoint then discard the top half of the list
- repeat 1, 2 and 3 until finished
|
