Algorithms: the learning path
- Tower of Hanoi: recursion, solved in 5 languages (5 steps, about 52 min, Beginner)
- Big O notation in 40 minutes (5 steps, about 41 min, Beginner)
- Find primes fast: sieve of Eratosthenes and beyond (6 steps, about 1 h 3 min, Intermediate)