Merge Sort
Halve recursively log₂(n) times and zip sorted halves via two-pointer merge for guaranteed O(n log n) stability.
Related problems 4
-
Sort an Array
-
Sort Linked List
-
Reverse Pairs
-
Merge k Sorted Lists
BigOCast BigOCast Halve recursively log₂(n) times and zip sorted halves via two-pointer merge for guaranteed O(n log n) stability.