🔀 Merge Sort

What you're seeing

Merge Sort recursively splits the array into halves until each sub-array has one element, then merges them back in sorted order. It guarantees O(n log n) time complexity.

• Red bars show the current split boundary.
• Yellow bars are being compared during the merge phase.
• Green bars are being written back from the merge buffer.
• Blue bars are fully sorted in their final position.