Difference between revisions of "W1172 Greatest Common Divisor"
From Coder Merlin
| Line 1: | Line 1: | ||
[[File:Euclid's algorithm Book VII Proposition 2 3.png|thumb|link=|Euclid's Algorithm]] | |||
== Prerequisites == | == Prerequisites == | ||
* [[W1151 Conditional and Flow Chart]] | * [[W1151 Conditional and Flow Chart]] | ||
| Line 7: | Line 7: | ||
== Background == | == Background == | ||
[https://en.wikipedia.org/wiki/Euclidean_algorithm Euclidean Algorithm] (Wikipedia) | [https://en.wikipedia.org/wiki/Euclidean_algorithm Euclidean Algorithm] (Wikipedia) | ||
<br clear="all"/> | |||
== Exercises == | == Exercises == | ||
{{W1172-Exercises}} | {{W1172-Exercises}} | ||
Revision as of 23:45, 20 January 2020
Within these castle walls be forged Mavens of Computer Science ...
— Merlin, The Coder
