Sorting Algorithms
GCSE: Bubble, Insertion, Merge
A Level: Quick
Select an algorithm to see its Big O complexity and logic.
Algorithm execution logs will appear here...
Searching Algorithms
GCSE: Linear, Binary
Data Structures & Traversal
A Level: Stacks, Queues, Lists, TreesPathfinding
A Level: Dijkstra, A*Click and drag to draw walls. Green = Start, Red = End.
Complexity & Big O Notation
| Notation | Name | Example |
|---|---|---|
| O(1) | Constant | Array index access |
| O(log n) | Logarithmic | Binary Search |
| O(n) | Linear | Linear Search |
| O(n log n) | Linearithmic | Merge Sort |
| O(n²) | Polynomial | Bubble Sort |
| O(2ⁿ) | Exponential | Recursive Fibonacci |
Growth rate visualization ($n$ increases right)