Interactive computer science lab
See the decision behind every move.
Learn 18 sorting algorithms through narrated, reversible traces, input experiments, predictions, and honest operation counts.
Start with Bubble SortAll 18 algorithm lessons
The interactive application adds reversible traces, practice, experiments, and saved progress. These direct lesson links remain useful when scripting is unavailable.
- Bubble Sort Exchange · O(n²) average
- Selection Sort Selection · O(n²) average
- Insertion Sort Insertion · O(n²) average
- Gnome Sort Exchange / insertion · O(n²) average
- Cocktail Shaker Sort Exchange · O(n²) average
- Merge Sort Divide & conquer · O(n log n) average
- Quick Sort Partitioning · O(n log n) average
- Heap Sort Selection with a heap · O(n log n) average
- Shell Sort Gap insertion · Gap-dependent average
- Comb Sort Gap exchange · About O(n²) average
- Smoothsort Leonardo heaps · O(n log n) average
- Counting Sort Counting · O(n + k) average
- Radix Sort Digit distribution · O(d(n + b)) average
- Bucket Sort Range distribution · O(n + k) average
- Timsort Merge + insertion · O(n log n) average
- Introsort Quick + heap + insertion · O(n log n) average
- Bogo Sort Random permutation · O(n × n!) average
- Sleep Sort Scheduling demonstration · O(max value) wait average