write a recursive algorithm to find the GCD of two numbers.

[[email protected]]

GCD algorithm....
GCD(BIG,SMALL)
BIG=SMALL*INTEGER + REMAINDER
SMALL=REMAINDER*INTEGER + REM#2
REMAINDER=REM#2*INTEGER+REM#3
When the remainder is 0, then the answer is what's being multiplied by an integer.
Example
GCD(1071,1029)
1071=1029*1 + 42
1029=42*24 + 21
42=21*2+0
GCD=21