An algorithm to compute the greatest common divisor of two positive 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.