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

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

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…