← Back

🌲 Forest of Divide & Unite

Watch Merge Sort Split and Reunite!

Phase

-

Depth

0

Comparisons

0

Merges

0

Step

0
🌲 Divide & Conquer Visualization 🌲
Generate an array to see merge sort in action!

πŸ“– Merge Sort

Divide: Split array into halves until single elements.

Conquer: Merge sorted halves back together.

Time: O(n log n) always - consistent performance!

Space: O(n) - Needs auxiliary space for merging