Difference between revisions of "W1172 Greatest Common Divisor"
From Coder Merlin
| Line 5: | Line 5: | ||
* [[W1153 Repeat-While Loop]] | * [[W1153 Repeat-While Loop]] | ||
* [[W1154 For Loop]] | * [[W1154 For Loop]] | ||
== Background == | == Background == | ||
[https://en.wikipedia.org/wiki/Euclidean_algorithm Euclidean Algorithm] (Wikipedia) | [https://en.wikipedia.org/wiki/Euclidean_algorithm Euclidean Algorithm] (Wikipedia) | ||
== Exercises == | == Exercises == | ||
{{W1172-Exercises}} | {{W1172-Exercises}} | ||
Revision as of 23:38, 20 January 2020
Within these castle walls be forged Mavens of Computer Science ...
— Merlin, The Coder
(image on right)
Prerequisites[edit]
Background[edit]
Euclidean Algorithm (Wikipedia)
