Category:Euclidean algorithm

From LiteratePrograms

The Euclidean algorithm is an efficient method for computing the greatest common divisor of two natural numbers (or polynomials, or any other object with the necessary structure), and was one of the first known algorithms to be described formally. It is based on the two identities:

a > b implies: gcd(a, b) = gcd(b, a mod b)

gcd(a, 0) = a

Articles in category "Euclidean algorithm"

There are 8 articles in this category.

C Euclidean algorithm (C) E Euclidean algorithm (Erlang)

F Euclidean algorithm (Forth) H Euclidean algorithm (Haskell) J Euclidean algorithm (Java)

O Euclidean algorithm (OCaml) P Euclidean algorithm (Prolog) Euclidean algorithm (Python)