Merge Sort Simulation

Step through balanced recursive splits and linear-time merges to see O(n log n) formation.

Controls

Elements

1/102

Current Frame

Depth 0 | Stage: enter

Step Detail

Enter segment length 12

Pseudocode

1function mergeSort(arr):
2  if length(arr) <= 1: return arr
3  mid = length(arr) // 2
4  left = mergeSort(arr[0:mid])
5  right = mergeSort(arr[mid:])
6  return merge(left, right)

Mechanics

Balanced halves give depth log n; merging walks two sorted streams, appending the smaller head, producing linear work per level.

View Theory Quick Sort