User:15071A05N7

1.EUCLIDS ALGORITHM: ->If A=0 then GCD (A,B)=B, and we can stop. ->If B=0 then GCD (A,B)=A,and we can stop. ->write A in quotient remainder form A=B.Q             +R. ->Find GCD (B, R) using the Euclid algorithm since GCD (A, B) =GCD (B,R).