Searching and Sorting

Searching and Sorting

1. Merge

   • Repeatedly splitting list in half
   • Merging the list back together and sorting
   • More efficient
   • hard to code

2. Binary

   • Splitting list in half
   • discarding higher or lower section than value needed
   • More efficient

3. Bubble

   • Swapping items in list if not in order
   • needs a final pass to check if sorted
   • Not very efficient
   • easy to code

4. Insertion

   • List is split into sorted and unsorted
   • go over every item in list and add to correct place in sorted list
   • Not very efficient
   • moderately easy to code

5. Linear

   • Go over every item in list
   • Innefficient