How Selection Sort Works

This animation visualizes the selection sort algorithm step by step on a row of bars representing unsorted values. It highlights the unsorted portion of the array, scans for the minimum element, and swaps it into place at the front, repeating until the list is fully sorted. Color-coded bars and a running pointer make the comparison and swap process clear, helping students see how the sorted region grows and understand the algorithm's time complexity.

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

The prompt that made it

Please show how selction sort works

Make your own version

Make the next one in this series

• Show how bubble sort works using the same bar visualization style
• Compare selection sort and insertion sort side by side with synced animations
• Visualize the time complexity growth of selection sort with a graph of comparisons versus input size

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…