Searching Algorithms

Searching Algorithms

1. Linear

   • Checks through each position one by one in order until the correct data is found
   • Data is not in an order
   • More simple
   • Slower than Binary
   • Example
     • Dog Cat Fish Zebra Giraffe
       • Question: Find Zebra using linear search
         • 1) Position0 = Zebra? No
           • 2) Position1 = Zebra? No
             • 3) Position2 = Zebra? No
               • 4) Position3 = Zebra? Yes

2. Binary

   • Finds the midpoint position of the positions and checks if that is the correct data, if not then it finds the midpoint of one of the halfs, and checks again, this is repeated until the correct data is found
   • Data is in an order
   • Faster/more efficient than Linear
     • Doesn't have to check every position
   • Better for bigger groups of data
   • Example
     • Cat Dog Fish Giraffe Zebra
       • Question: Find Dog using Binary search
         • 1) (0+4)/2 = 2
           • 2) Position2 = Dog? No
             • 3) (0+1)/2 = 0.5=1
               • 4) Position1 = Dog? Yes
   • More complicated

3. Zebra Dog Giraffe Cat Fish

   • Position0 = Zebra
     • Position1 = Dog
       • Position2 = Giraffe
         • Position3= Cat
           • Position4 = Fish