computing gcd(a,b)

Euclid(a,b: integer):integer

{assumes a>b}

 

IF b=0 THEN RETURN a

ELSE RETURN Euclid(b,a mod b)

 

 

running time: O(|a|+|b|)