Merge Sort

Divide-and-conquer: split in half, recursively sort, merge.

Best: O(n log n) Worst: O(n log n) Space: O(n) Stable

slow fast

Default

Comparing

Taken/Merged

Merging

Step

0/0

Depth

0

Comparisons

0

Merges

0

Algorithm Trace

Press Start to run animation.