Closed Deven1902 closed 2 years ago
Merge sort works by splitting the input list into two halves, repeating the process on those halves, and finally merging the two sorted halves together.
Time complexity: O(nlogn).
Merge sort works by splitting the input list into two halves, repeating the process on those halves, and finally merging the two sorted halves together.
Time complexity: O(nlogn).