50
MergeSort
Stable divide-and-conquer sorting algorithm with guaranteed O(n log n) performance. Used in Java's Arrays.sort() for objects.
Time Complexity
Best:
O(n log n)Average:
O(n log n)Worst:
O(n log n)Space Complexity
O(n)Properties
Stable
Color Legend
Default
Comparing
Swapping
Sorted
Pivot
Setting Value