Searching Algorithms

Searching Algorithms

1. Linear Search

   • the simplest search method
   • checks every element until the item is found or the entire list is searched
   • can be slow in large arrays
   • if there are millions of values then all of them may need checking
   • the bigger the data to be searched, the longer it will take
   • advantages
     • simple algorithm
     • works on any list
   • disadvantages
     • slow on large lists

2. Binary Search

   • only if the data is in order
   • checks the middle value of the list
   • depending on if the value is higher or lower than the searched value
     • eliminates half the values and then tries again
   • much faster than linear search
   • millions of values can be searched in 20 steps
   • only works when data is sorted
   • advantages
     • very fast on large lists
   • disadvantages
     • only works when data is sorted