'Integers q1' presentation slideshows

Euclidean Algorithm for GCD

Euclidean Algorithm for GCD. CSCI 284/162 Spring 2007 GWU. Euclidean Algorithm considered first non-trivial algorithm. Algorithm_gcd(m, a) /* m > a */ (X, Y) := (m, a) /* Initialize */ while (Y ? 0) (X, Y) := (Y, X rem Y) return(X) Works because: gcd (X, Y) = gcd(Y, X rem Y)

838 views • 9 slides