search

Linear Search

• check each array element in turn until you find it.

Binary Search

• Assume the elements are sorted

Comparing the two

• Linear search requires between 1 and n comparisons/array accesses.
• Binary search requires between 1 and log(n) comparisons/array accesses.