help:algorithms:euclid
| DATA ANALYTICS REFERENCE DOCUMENT |
|
|---|---|
| Document Title: | Euclidean Algorithm |
| Document No.: | 1548421667 |
| Author(s): | Gerhard van der Linde |
| Contributor(s): | |
REVISION HISTORY
| Revision | Details of Modification(s) | Reason for modification | Date | By |
|---|---|---|---|---|
| 0 | Draft release | Euclidean Algorithm | 2019/01/25 13:07 | Gerhard van der Linde |
Euclidean Algorithm
The Euclidean Algorithm is a technique for quickly finding the GCD of two integers.
Greatest Common Divisor (GCD) of two integers A and B is the largest integer that divides both A and B.
help/algorithms/euclid.txt · Last modified: 2020/06/20 14:39 by 127.0.0.1