Vismo · Create · Explore · Topics · Guides · Pricing

Algorithms animations

12 verified, narrated animations about algorithms, reviewed by hand and checked at animation steps. Watch free; download the video or adapt it to your lesson with any paid plan.

Minimum spanning tree with Kruskal's algorithm
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
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…

Binary search tree: smaller left, larger right
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
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
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
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
Quicksort: pick a pivot, partition, recurse

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

Merge sort: split, then merge sorted halves
Merge sort: split, then merge sorted halves

An array of eight values is recursively divided into halves until single elements remain, then pairs are merge…

Selection sort: find the smallest, put it in place
Selection sort: find the smallest, put it in place

This animation visualizes selection sort by highlighting the unsorted portion of an array, using a yellow scan…

Insertion sort: grow a sorted prefix
Insertion sort: grow a sorted prefix

This animation shows insertion sort in action: each new value is lifted from the array and slid leftward past …

Bubble sort: swap neighbours until nothing moves
Bubble sort: swap neighbours until nothing moves

Six numbers are sorted using bubble sort, with each pass comparing neighboring values and swapping them when t…

k-nearest neighbours: ask the closest points
k-nearest neighbours: ask the closest points

Two labeled classes of points sit on a plane alongside one new, unlabeled point. For k = 1, 3, and 7, the anim…

Browse the whole Library