Algorithms

Algorithms

1. Sorting Algorithms

   • Merge Sort
     • Process
       • 1. Split the list in half
         • 2nd sublist should start in the middle item.
       • 2. Repeat step one until the lists only contain one item
       • 3. Merge pairs of sub-lists
         • while sorting them into the correct order
       • 4. Repeat step three until all the sub lists are merged
     • Pros
       • More efficient and quicker than others
       • Consistant running time
         • Regardless of how ordered the list is
     • Cons
       • Its slower than other algorithms in small lists
       • An ordered list still goes through this process
       • Uses more memory
   • Insertion Sort

2. Search Algorithms