Search Algorithms

Search Algorithms

1. Linear Search

   • Simple
     • Start at top and go thru everything
   • Problems
     • slow in large arrays
     • if there is million values then all may need to be checked
     • bigger data = longer search
     • slow on large lists
   • advantages
     • works on any list
     • simple and easy

2. Binary Search

   • works on ordered data
   • check middle value
     • see if higher or lower
       • eliminate values that are wrong
         • repeat until get correct
   • MUCH faster than linear
   • million values and be searched in 20 steps
     • as opposed to 1000000
   • only works when data is sorted
     • numerically or alphabetically
   • advantages
     • very fast on large lists
   • disadvantage
     • only works if data is sorted