June 2018 Update

Task/Greatest-common-divisor/AWK/greatest-common-divisor.awk

@@ -1,4 +1,4 @@
-$ awk 'func gcd(p,q){return(q?gcd(q,(p%q)):p)}{print gcd($1,$2)}'
+$ awk 'function gcd(p,q){return(q?gcd(q,(p%q)):p)}{print gcd($1,$2)}'
 12 16
 4
 22 33

Task/Greatest-common-divisor/Elena/greatest-common-divisor.elena

@@ -0,0 +1,34 @@
+import system'math.
+import extensions.
+
+gcd = (:a:b)
+[
+    var $a := a.
+    var $b := b.
+    while($b != 0)
+    [
+        var tmp := $a.
+        $a := $b.
+        $b := tmp mod($b).
+    ].
+
+    ^ $a.
+].
+
+printGCD = (:a:b)
+[
+    console printLineFormatted("GCD of {0} and {1} is {2}", a, b, gcd(a,b)).
+].
+
+program =
+[
+    printGCD(1,1).
+    printGCD(1,10).
+    printGCD(10,100).
+    printGCD(5,50).
+    printGCD(8,24).
+    printGCD(36,17).
+    printGCD(36,18).
+    printGCD(36,19).
+    printGCD(36,33).
+].

Task/Greatest-common-divisor/Klong/greatest-common-divisor.klong

@@ -0,0 +1 @@
+gcd::{:[~x;y:|~y;x:|x>y;.f(y;x!y);.f(x;y!x)]}

Task/Greatest-common-divisor/Ruby/greatest-common-divisor-1.rb

@@ -1,2 +1 @@
-irb(main):001:0> 40902.gcd(24140)
-=> 34
+40902.gcd(24140)  # => 34

Task/Greatest-common-divisor/Simula/greatest-common-divisor.simula

@@ -0,0 +1,23 @@
+BEGIN
+    INTEGER PROCEDURE GCD(a, b); INTEGER a, b;
+    BEGIN
+        IF a = 0 THEN a := b
+        ELSE
+            WHILE 0 < b DO BEGIN INTEGER i;
+                i := MOD(a, b); a := b; b := i;
+            END;
+        GCD := a
+    END;
+
+    INTEGER a, b;
+    !outint(SYSOUT.IMAGE.MAIN.LENGTH, 0);!OUTIMAGE;!OUTIMAGE;
+    !SYSOUT.IMAGE :- BLANKS(132);  ! this may or may not work;
+    FOR b := 1 STEP 5 UNTIL 37 DO BEGIN
+        FOR a := 0 STEP 2 UNTIL 21 DO BEGIN
+            OUTTEXT("  ("); OUTINT(a, 0);
+            OUTCHAR(','); OUTINT(b, 2);
+            OUTCHAR(')'); OUTINT(GCD(a, b), 3);
+        END;
+        OUTIMAGE
+    END
+END

Task/Greatest-common-divisor/Stata/greatest-common-divisor.stata

@@ -0,0 +1,9 @@
+function gcd(a_,b_) {
+	a = abs(a_)
+	b = abs(b_)
+	while (b>0) {
+		a = mod(a,b)
+		swap(a,b)
+	}
+	return(a)
+}

Task/Greatest-common-divisor/XLISP/greatest-common-divisor.xlisp

@@ -0,0 +1,4 @@
+(defun greatest-common-divisor (x y)
+	(if (= y 0)
+		x
+		(greatest-common-divisor y (mod x y)) ) )