Search and Sort

Search and Sort

1. Sort

   • Merge
     • Splits list in half
       • Repeats until all lists only contain one item
         • Merge pairs of sub-lists, sorting items into right order
           • Repeats until all lists are merged together
     • Pros
       • More efficient and quicker
       • Consistent running time
     • Cons
       • Slower for small lists
       • Uses more memory
   • Insertion
     • Looks at second item in list
       • Compares it to all items before it and inserts into right place
         • Repeats until the last number has been inserted into the correct place
     • Cons
       • Doesn't work well with large lists
     • Pros
       • Intuituve
       • Copes well with small lists
   • Bubble
     • Goes through list ordering pairs
     • Pros
     • Cons
       • Doesn't cope well with large lists

2. Search

   • Linear
     • Unordered list
     • Goes through each item one-by-one
   • Binary
     • Ordered list
     • Splits list in two iteratively