Sorting Algorithms
Watch comparisons and swaps put data in order.
- Beginner☕
Bubble Sort
Swap neighbours until nothing moves
O(n²)→
- Beginner☕
Selection Sort
Select the minimum, grow the sorted region
O(n²)→
- Beginner
Insertion Sort
Insert each card into a sorted hand
O(n²)→
- Intermediate
Merge Sort
Divide, conquer, merge
O(n log n)→
- Intermediate
Quick Sort
Partition around a pivot
O(n log n) average→
- Advanced
Heap Sort
Sort with a max-heap
O(n log n)→