Home > Term: Euclidean algorithm
Euclidean algorithm
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.
- Del af tale: noun
- Branche/domæne: Computer science
- Category: Algorithms & data structures
- Government Agency: NIST
0
Ophavsmand
- GeorgeV
- 100% positive feedback