How Merge Sort Divides And Conquers

This animation visualizes merge sort by showing an unsorted array repeatedly split into smaller halves until each piece holds a single element, then merged back together in sorted order. Color-coded bars highlight comparisons during each merge step, making the divide-and-conquer strategy and the O(n log n) structure visible. Useful for students learning algorithm design and teachers introducing recursion, sorting efficiency, and comparisons with simpler sorts like bubble sort.

16:9 · Preview before teaching · automatic layout checks do not establish subject accuracy

The prompt that made it

Please show how merge sort works please

Make your own version

Make the next one in this series

• Compare merge sort and quicksort side by side on the same array
• Show how recursion trees relate to merge sort's time complexity
• Animate bubble sort to contrast its step-by-step swaps with merge sort

Related animations

How A Perceptron Makes A Decision

This animation visualizes a single perceptron processing weighted inputs, summing them with a bias, and passin…

From logic gates to arithmetic: the half adder

This animation shows how a half adder circuit uses an XOR gate to compute the sum bit and an AND gate to compu…

Minimum spanning tree with Kruskal's algorithm

A weighted graph is processed by sorting all edges from cheapest to most expensive, adding each one only if it…

Fibonacci: the recursion tree repeats work; memoisation removes it

This animation draws the full recursion tree for fib(5), showing all 15 calls and highlighting the repeated su…

Recursion on the call stack: 5! unwinds

This animation visualizes fact(5) as it pushes five stacked frames, one for each recursive call, until reachin…

Binary search tree: smaller left, larger right

Values 50, 30, 70, 20, 40, 60, 80, and 35 are inserted one at a time into a binary search tree, with each comp…