Merge Sort
Time Complexity: O(n log n)
Space Complexity: O(n)
Process
Divide the list into two halves, recursively sort each half, and then merge the sorted halves to produce a sorted list.
Efficiency
Efficient and has a consistent time complexity of O(n log n), making it suitable for large datasets. It uses a divide-and-conquer approach.