History of Algorithm

HomePage | Recent Changes | Preferences

	Revision 39 . . (edit) December 19, 2001 8:17 pm by Hannes Hirzel
	Revision 38 . . December 12, 2001 7:19 am by Taw [natural -> positive integer]
	Revision 37 . . December 12, 2001 7:07 am by Taw [link to Algorithms on Wikipedia]
	Revision 36 . . December 2, 2001 8:30 pm by (logged).26.10.xxx
	Revision 35 . . December 2, 2001 8:30 pm by (logged).26.10.xxx
	Revision 34 . . November 30, 2001 7:47 am by The ansible [That's funny, but doesn't really belong in this article]
	Revision 33 . . November 30, 2001 7:28 am by Ed Poor
	Revision 32 . . November 30, 2001 7:27 am by (logged).248.56.xxx
	Revision 31 . . (edit) November 30, 2001 7:25 am by (logged).248.56.xxx *[ Adding link to "bulletproof" lingo]**
	Revision 30 . . (edit) November 30, 2001 7:24 am by (logged).248.56.xxx *[ Adding link to "bulletproof" lingo]**
	Revision 29 . . (edit) November 27, 2001 8:03 am by AxelBoldt
	Revision 28 . . November 27, 2001 7:41 am by (logged).35.86.xxx
	Revision 27 . . October 31, 2001 12:33 am by Seb [added kinds of algorithms, according to the strategy used]

Difference (from prior major revision) (minor diff, author diff)

Changed: 5c5

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.