Merge Sort

Time Complexity- Average case: O(n logn) | | | | Worst-case: O(n logn) | | | | Best case: O(n logn)