Setup Array
Sort Controls
Array Visualization
Temporary Array:
Colors: Blue = Left Half, Purple = Right Half, Orange = Merging, Yellow = Comparing, Light Blue = Temp Array, Green = Sorted
Merge Sort is a divide-and-conquer sorting algorithm that recursively divides the array into halves, sorts them, and merges them back together.
How it works:
Time Complexity: O(n log n) guaranteed, stable sort