CS-Search Algorithms:

CS-Search Algorithms:

1. Linear Search:

   • Simplest search method-starts at the top and works all of the way through until the search term is found.
   • Advantages:
     • Simple algorithm
     • Works on any list
   • Disadvantages:
     • Slow on large lists.

2. Binary Search:

   • If the data is ordered, then a binary search can be used.
   • The middle value is checked then depending on whether it is higher or lower than the search value, eliminate half and try again.
   • Advantages:
     • Very fast on large lists
   • Disadvantage:
     • Only works if the data is sorted.