GCD (Euclidean Algorithm) Explained: Tracing gcd(24, 18), gcd(5, 0), gcd(17, 13)
Learn how the Euclidean algorithm quickly finds the greatest common divisor. Step through concrete calculations for 24, 18, 5, 0, 17, and 13.
CONCEPT BLOGS
Multi-phase guides with mental models, worked examples, diagrams, and real edge cases — the public form of Learnisim AI's conceptual learning. Read here; train it interactively in the app.
Learn how the Euclidean algorithm quickly finds the greatest common divisor. Step through concrete calculations for 24, 18, 5, 0, 17, and 13.
Learn the Boyer-Moore Majority Vote Algorithm by tracing [3, 2, 3] and [2, 2, 1, 1, 1, 2, 2] using the intuitive tug-of-war cancellation mental model.
Learn how to rotate a 3×3 matrix [[1,2,3],[4,5,6],[7,8,9]] 90° clockwise in-place using transpose and reverse steps without extra memory.
Learn Set Matrix Zeroes using in-place markers. Trace the [[1,1,1],[1,0,1],[1,1,1]] example step-by-step and master the flag split edge case.
Trace the greedy expanding reach model on [2, 3, 1, 1, 4] and contrast it with getting stuck at the zero in [3, 2, 1, 0, 4].
Trace the lexicographic pivot-and-reverse algorithm step-by-step using the sequences [1, 3, 2] and [3, 2, 1] to understand sequence rearrangement.