Hva er Euklids algoritme?
Klikk for å snu kortet
gcd(a,b)=gcd(b,a mod b)\gcd(a,b)=\gcd(b, a\bmod b)gcd(a,b)=gcd(b,amodb). Terminerer når b=0b=0b=0. O(log(min(a,b)))O(\log(\min(a,b)))O(log(min(a,b))).
Space / Enter for å snu