Merge Sort
An efficient, stable, comparison-based sorting algorithm that uses a divide and conquer strategy.
Visualization
Watch Merge Sort in action.
Step: 0 / 0
Comparisons: 0Swaps: 0
Current Step Details
Generating steps...
Comparing
Swapping
Pivot Element
Sorted Element
Sub-array Boundary
Special (e.g., Min/Key)