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
Computer science articles
Concepts and algorithms explained step by step, with examples and interactive laboratories.
Algorithms
Weighted graphs: Dijkstra, Prim and Kruskal step by step
Three algorithms for weighted graphs: shortest paths and minimum spanning trees, with an interactive 20–100-node laboratory.
ReadSorting an array: Bubble Sort, Selection Sort and Insertion Sort
Three ways to sort the same numbers: comparisons, swaps and step-by-step examples, with a visual laboratory.
ReadArticles 1–3 of 3