ConceptSystems & CS
Euclid's algorithm
An ancient algorithm for computing the greatest common divisor of two numbers.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
4Each in their own terms, from the easiest level.
Leslie Lamport
An algorithm that computes the greatest common divisor of two natural numbers M and N by iteratively subtracting the smaller from the larger until they are equal.Tom Leighton
An algorithm for computing the greatest common divisor of two integers, also referred to as the pulverizer.Edsger W. Dijkstra
An algorithm for computing the greatest common divisor of two integers by repeatedly subtracting or taking the remainder.
Lectures that assume it
1Connections
8The lectures that define it or assume it, and the concepts next to it.