REM Compute a GCD using Euclid's Algorithm
REM Robert Campbell, 970628

DECLARE FUNCTION gcd& (int1&, int2&)

PRINT "Enter numbers for gcd computation:"
INPUT "    First: ", first&
INPUT "    Second: ", second&
temp& = gcd&(first&, second&)
PRINT "gcd(", first&, ", ", second&, ") = ", temp&
END

FUNCTION gcd& (x&, y&)
int1& = x&
int2& = y&
IF (int1& > int2&) THEN
        temp& = int1&
        int1& = int2&
        int2& = temp&
END IF
PRINT int1&, int2&
DO
    int2& = int2& - int1& * (int2& \ int1&)
    PRINT int1&, int2&
    IF (int2& = 0) THEN
        gcd& = int1&
        EXIT FUNCTION
    END IF
    int1& = int1& - int2& * (int1& \ int2&)
    PRINT int1&, int2&
    IF (int1& = 0) THEN
        gcd& = int2&
        EXIT FUNCTION
    END IF
LOOP
STOP
END

END FUNCTION