Searching and Sorting

Searching and Sorting

1. Searching

   • Linear Search
     • Inefficient
     • Go over every item in list
   • Binary Search
     • Splitting list in half
     • Discarding higher or lower section than value needed
     • More efficient.

2. Sorting

   • Merge
     • hard to code
     • Repeatedly splitting list in half and swapping values
     • More efficient on large lists
     • Merges list back together
   • Bubble
     • Simpilist to code
     • Comparing and swapping values
     • Easy to understand in terms of pseudocde
     • Not very efficient on large lists
     • needs a final pass to check if sorted
   • Insertion