Demonstration and visualization of multiple algorithms taught in Computer Science courses.
- Quick sort
- Bubble sort
- Cocktail Shaker Sort
- Gnome Sort
- Optimized Gnome Sort
- Odd-Even Sort
- Selection Sort
- Double Selection Sort
- Insertion Sort
- Binary Insertion Sort
- Comb Sort
- Shell Sort
- Merge Sort
- Binary Merge Sort
- Weave Merge Sort
- TimSort
- Merge Sort In-Place
- WikiSort
- GrailSort
- Stable Quick Sort
- Dual Pivot Quick Sort
- Max Heap Sort
- Min Heap Sort
- Weak Heap Sort
- Ternary Heap Sort
- Smooth Sort
- Tournament Sort
- Cycle Sort
- Introsort
- Quick Shell Sort
- Insert/Bottom-Up Merge
- Batcher's Odd-Even Mergesort
- Batcher's Bitonic Sort
- Pancake Sort
- Patience Sort
- Gravity Sort
- Counting Sort
- Pigeonhole Sort
- Radix LSD Sort (Base 4)
- American Flag Sort (128 Buckets)
- Radix LSD In-Place Sort (Base 10)
- Radix LSD In-Place Sort (Base 2)
- Radix MSD Sort (Base 4)
- Radix MSD Sort (Base 2)
- Shatter Sort
- Simple Shatter Sort
- Flash Sort
- Time Sort (Mul 4) + Insertion Sort
- Stooge Sort
- Bad Sort
- Silly Sort
- Slow Sort
- Less Bogo Sort
- Cocktail Bogo Sort
- Bogo Sort