Search and Sort

Search and Sort

1. Sort

   • Insertion
     • Looks at value and compares it to previous
       • Sorts them
       • Continues until last number has been inserted
   • Merge
     • Repeatably splits the list in half
     • Sorts pairs then merges them
     • Pros
       • More efficient and quicker than bubble and insertion
       • Consistent running time
     • Cons
       • Slower for small lists
       • Continues even if list is sorted
       • Uses more memory
   • Bubble
     • Goes through list ordering pairs
       • Until list is sorted

2. Search

   • Linear
     • Un-ordered list
     • Goes through every value from beginning of list
       • Until list is sorted
   • Binary
     • Splits list in half
       • Goes to appropraite side of value
         • Splits smaller list in half
     • Ordered list