Comparisons:
0
Swaps:
0
Time:
0.000 seconds
Algorithm Notes & Warnings:
- Bitonic / Batcher's Sorts: Best used with array sizes that are powers of 2 (e.g., 16, 32, 64).
- Bead Sort: Deterministic but only works for positive integers.
- AKS Sorting Network: Primarily theoretical; implemented here as an optimized network variant.
- Slow Sort: Deliberately inefficient (multiplicative complexity) - use with small array sizes!
- Bogo Sort: Random shuffle until sorted. Good luck if the size is > 5.
Note: Array size range is 4-128 in normal mode. Benchmarking large sizes (2048+) might take a while due to javascript limitations.