← Back to demos
Algorithm Playground
A hands-on merge sort and Count-Min Sketch visualizer that can be opened without reading a post first.
Read the related post →Merge Sort Visualizer
A Divide and Conquer sorting demonstration.
Size8
ℹ️
Speed
❓ Recursion
Merge sort uses a top-down recursive approach. It divides the array into single elements before merging them back in order.
❓ Stability
Merge sort is stable, meaning elements with equal values maintain their relative order, which is crucial for multi-key sorting.
❓ Complexity
Time:O(n log n)
Space:O(n)