Loading...
Divide: split segment [12, 5, 7, 3, 9, 1] at mid = 3.
Splitting segment at midpoint.
Solved subproblems; ready to merge.
Combining sorted halves.
This visualizer demonstrates the classic divide & conquer pattern by animating merge sort. The array breaks into single-element base cases (conquer), then merges upward rebuilding sorted segments. Each frame highlights: Divide, Conquer, or Merge. Experiment by entering custom arrays, adjusting speed, and stepping through frames to observe recursion structure and merge dynamics.