Merge Sort

Merge Sort

1. Merge Sort provides a higher sorting speed

   • O(N * log n)

2. Divide

   • n-element collection to be sorted into two sub-collections of n/2 elements each

3. Conquer

   • Sort the two sub-collections recursively

4. Combine

   • Merge the two sorted sub-collections to produce the sorted answer.