Difference between revisions of "W1172 Greatest Common Divisor"
From Coder Merlin
| (3 intermediate revisions by the same user not shown) | |||
| 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 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) | ||
* [https://www.inchcalculator.com/euclidean-algorithm-calculator/ Calculator] (Inch Calculator) | |||
<br clear="all"/> | |||
== Exercises == | == Exercises == | ||
{{ | {{Exercises| | ||
# {{MMMAssignment|M1172-10}} | |||
}} | |||
Latest revision as of 20:29, 27 November 2021
Within these castle walls be forged Mavens of Computer Science ...
— Merlin, The Coder
Prerequisites[edit]
Background[edit]
- Euclidean Algorithm (Wikipedia)
- Calculator (Inch Calculator)
Exercises[edit]
Exercises
- M1172-10 Complete Merlin Mission Manager Mission M1172-10.
