The greatest common divisor of two integers is the largest positive integer that divides them both. This article considers two algorithms for computing \hbox{gcd}(u,v), the greatest common divisor of u and v.
Posts tagged multiple-precision
Implementing Multiple-Precision Arithmetic, Part 2
Introduction
This article is a follow-up to part 1 where multiple-precision addition, subtraction, and multiplication for non-negative integers was discussed. This article deals with division. Again, the theoretic foundation is based on Section 4.3.1, The Classical Algorithms, of The Art of Computer Programming, Volume 2, by Donald E. Knuth.
Implementing Multiple-Precision Arithmetic, Part 1
Introduction
This article is the first in a series dealing with algorithms for multiple-precision arithmetic. The goal is to present both a theoretical foundation with high-level algorithm descriptions (based on Section 4.3.1, The Classical Algorithms, of The Art of Computer Programming, Volume 2, by Donald E. Knuth) and a portable C++ implementation of the algorithms. The theory and [...]
)
