Searching Lab Report
A. Beauregard Clump
S. Superprogrammer
Friday, February 30, 2000


General Results

Button Name Searching Algorithm
Sigma Binary Search
Tau Sequential Search

Rationale

    We chose to search data sets of size 500, 1000, and 2000, looking for the last item each time.  Button Tau took 500, 1000, and 2000 comparisons each time, doubling the number of comparisons each time the size of the searchable list doubled.  Button Sigma took many fewer comparisons and this number increased by only one each time we doubled the size of the searchable list. 

     Since sequential search is linear, we conclude that TAU is SEQUENTIAL SEARCH.

      Then, by process of elimination, we conclude that SIGMA is BINARY SEARCH.