Euclid's GCD Algorithm as Computer Programs

(assuming that M and N already have values and that M > N)

r = m % n;
while ( r != 0 )
{
	m = n;
	n = r;
	r = m % n;
}

R = M MOD N
WHILE R <> 0
	M = N
	N = R
	R = M MOD N
WEND

R := M Mod N;
While R <> 0 Do 
Begin
	M := N;
	N := R;
	R := M Mod N;
End;

End Of Lesson 1

Next Lesson