Pick two algorithms, same data, and watch them race. Who finishes first?
Designed with the WJEC specification in mindNot all algorithms are created equal! Some work great on small datasets but struggle with large ones. This battleground lets you pit two algorithms against each other to see which performs better on the same task.
| Algorithm | Best | Average | Worst | Stable? |
|---|---|---|---|---|
| Bubble Sort | O(n) | O(n²) | O(n²) | ✅ |
| Insertion Sort | O(n) | O(n²) | O(n²) | ✅ |
| Selection Sort | O(n²) | O(n²) | O(n²) | ❌ |
| Merge Sort | O(n log n) | O(n log n) | O(n log n) | ✅ |
| Quick Sort | O(n log n) | O(n log n) | O(n²) | ❌ |