On the complexity of the extended euclid
β
George Havas
π
Article
π
2003
π
Elsevier Science
π
English
β 92 KB
Euclid's algorithm for computing the greatest common divisor of 2 numbers is considered to be the oldest proper algorithm known ([10]). This algorithm can be amplified naturally in various ways. The GCD problem for more than two numbers is interesting in its own right. Thus, we can use Euclid's algo