As an example of an algorithm, here is one given to us by Euclid, and thus known as Euclid's Algorithm, for finding the greatest common divisor (GCD) of two natural numbers A and B:
As an example of an algorithm, here is one given to us by Euclid, and thus known as Euclid's Algorithm, for finding the greatest common divisor (GCD) of two positive integers A and B:
Changed: 31c31
* Donald E Knuth: The Art of Computer Programming, Vol 1-3, Addison Wesley 1998. The standard reference.