Sorting algorithms visualised: bubble sort to quicksort
10 steps · about 3 h 38 min · Beginner
- 15 Sorting Algorithms in 6 Minutes (video, Timo Bingmann (YouTube), 8 min)
A quick visual and audio overview shows how differently the algorithms behave before you study any of them.
- Bubble sort (article, Wikipedia, 15 min)
Bubble sort is the simplest sort to follow, and it shows why a simple method can still be slow.
- Sort Visualizer (interactive, sortvisualizer.com, 15 min)
Run bubble, selection and insertion sort yourself and see the quadratic group next to the logarithmic group.
- Insertion sort pseudocode (article, Khan Academy, 15 min)
Insertion sort is the next step up, and it is written out as pseudocode you can turn into code.
- Sorting (Bubble, Selection, Insertion, Merge, Quick, Counting, Radix) - VisuAlgo (interactive, VisuAlgo (NUS), 40 min)
A step-by-step e-lecture from a university, with code tracing and quizzes, that ties every algorithm to its complexity.
- Lecture 3 - CS50x 2026 (article, Harvard CS50, 30 min)
It explains merge sort as recursion and divide and conquer, and compares it with bubble and selection sort.
- Overview of quicksort (article, Khan Academy, 15 min)
It shows how quicksort partitions around a pivot, and how that differs from merge sort.
- Sorting Algorithm Visualizer — Bubble, Merge & Quicksort (interactive, lkforge, 15 min)
Turn on the comparison counter and run bubble sort and quicksort on the same array to see the gap in numbers.
- Quicksort (article, Wikipedia, 25 min)
It covers quicksort's history, its average and worst cases, and why most implementations are not stable.
- Mergesort and Quicksort (reference, Princeton Algorithms (Sedgewick & Wayne), 40 min)
It finishes with real code and the compare-based lower bound on sorting, so you can see the limits of these algorithms.