Category: Euler GCD

03
Jun
2017

Algorithm: Euler’s GCD

code: int euclid_gcd(int a,int b) { int dividend,divisor,remainder; dividend = a>=b?a:b; divisor= a<=b?a:b; while(divisor!=0) { remainder=dividend%divisor; dividend=divisor;…