Merge Sort Visualizer

Watch how Merge Sort uses divide-and-conquer to split the array into halves and merge them back in sorted order.

Time: O(n log n)

Space: O(n)

Stable: Yes

Divide & Conquer

Animation Speed: 1000ms

Fast (500ms)Slow (3000ms)

Progress: Step 1 of 0Level 0 of 0 | Phase: start

640

341

252

123

224

115

906

Unsorted

Left Section

Right Section

Left Pointer

Right Pointer

Merging

Sorted

Click Play to begin the Merge Sort visualization

Best Case:O(n log n)

Average Case:O(n log n)

Worst Case:O(n log n)

Space:O(n)

Stable:Yes

In-place:No

Question 1 of 3

What is Merge Sort's space complexity?

DSAverse

Sorting Algorithms

Loading Sorting Algorithms...

Sorting Visualization

n = 8 elementscomparing...