Definition: An algorithm to compute the greatest common divisor of two integers. It is Euclid(a,b){if (b=0) then return a; else return Euclid(b, a mod b);}. The run time complexity is O(( log a)( log b)) bit operations.
Also known as Euclidean algorithm.
Back
user comments and suggestions are invited at KmailDrive@gmail.com
