Merge Sort Monster
Merge sort is an efficient, stable, comparison-based sorting algorithm. It uses divide-and-conquer to split and merge sorted segments.
0
Array Size
0
Comparisons
0
Assignments
0
Total Steps
MERGE SORT
Execution Log
Ready. Click Play to start merge sort.
Sorting Challenge
Can you sort the array manually with the optimal number of swaps? Click any two bars to swap them.
🛠️ Array Controls
⚡ Algorithm Complexity
Worst-case Time
O(n log n)
Average Time
O(n log n)
Space Complexity
O(n)