A Java implementation of the Euclidean Algorithm for computing the Greatest Common Divisor (GCD) of two nonnegative integers. This project was originally developed as part of a Discrete Structures ...
It is named after the ancient Greek mathematician Euclid, who first described it in Euclid's Elements . It is an example of an algorithm, a step-by-step procedure for performing a calculation ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results