← Back to all tools

⚔️ Algorithm Battleground

Pick two algorithms, same data, and watch them race. Who finishes first?

Designed with the WJEC specification in mind
CS GCSE §1.4CS A-Level Unit 3
VS
Merge Sort O(n log n)
Comparisons: 0 Swaps: 0 Time:
Bubble Sort O(n²)
Comparisons: 0 Swaps: 0 Time:
📖

Algorithm Complexities

AlgorithmBestAverageWorstStable?
Bubble SortO(n)O(n²)O(n²)
Insertion SortO(n)O(n²)O(n²)
Selection SortO(n²)O(n²)O(n²)
Merge SortO(n log n)O(n log n)O(n log n)
Quick SortO(n log n)O(n log n)O(n²)