Performance
- Best: O(n log n)
- Average: O(n log n)
- Worst:O(n Log n)
Steps in mergesort
- Recursively Keep on splitting the list until each list has 1 or 2 elements.
- If the list has one element it is already sorted.
- If the list has two elements then sort it.
- Combine lists in sorted order in an upward direction.
