Tower of Hanoi: rules, strategy and recursion
From the first moves to recursive strategy: examples with one, two and three disks, the minimum move count and an interactive laboratory with ten levels.
ReadComputer science
Concepts and algorithms explained step by step, with examples and interactive laboratories.
From the first moves to recursive strategy: examples with one, two and three disks, the minimum move count and an interactive laboratory with ten levels.
ReadThree ways to sort the same numbers: comparisons, swaps and step-by-step examples, with a visual laboratory.
ReadArticles 1–2 of 2