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 · every frame verified for overlaps, spacing and edges before rendering

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

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…

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…

Hash tables: a formula decides where each key lives

Seven buckets receive keys according to key mod 7, with collisions stacked as chains beneath each bucket. A lo…

Big-O: how running time grows with the input

This animation plots O(1), O(log n), O(n), O(n log n), O(n^2), and O(2^n) on shared axes, showing how each cur…

Linear search vs binary search: count the comparisons

This animation compares two ways to find the value 51 in a sorted list of 16 numbers. Linear search checks eac…

Quicksort: pick a pivot, partition, recurse

This animation walks through the Lomuto partition method used in quicksort, choosing the last element as pivot…