Algorithm: Difference between revisions

Revision as of 15:22, 27 December 2001

Revision as of 14:00, 8 January 2002

Line 7:

As an example of an algorithm, here is one given to us by [[Euclid]], and thus known as Euclid'sthe Algorithm[[Euclidean algorithm]], for finding the [[greatest common divisor]] (GCD) of two positive [[integer|integers]] A and B:

Line 66:

/Talk