Greatest common divisor: Difference between revisions
m
→{{header|MiniScript}}
(added MiniScript example) |
|||
Line 2,701:
=={{header|MiniScript}}==
Using an iterative Euclidean algorithm:
<lang MiniScript>gcd = function(a, b)
while b
|