Searching Algorithms

Searching Algorithms

1. Linear Search

   • Checks each item of an UNORDERED list in turn to see if it is the correct one
   • It stops when it either finds the item or reaches the end of the list

2. Binary Search

   • Only works on an ORDERED list
   • Step 1 - Find the middle item using (n+1)/2 and round up
   • Step 2 - If this is the item, stop
   • Step 3 - If not, compare item with middle. If bigger, get rid of lower half, if smaller, get rid of upper half
   • Step 4 - Repeat steps 1 - 3 until you find the item