History of Algorithms on Wikipedia

HomePage | Recent Changes | Preferences

	Revision 18 . . (edit) December 15, 2001 7:16 am by Lee Daniel Crocker
	Revision 17 . . December 15, 2001 7:14 am by Taw [tried to make "conclusion" (==There is some controversy...) statement about ruby and pseudocode]
	Revision 16 . . December 14, 2001 8:51 am by Lee Daniel Crocker
	Revision 15 . . December 14, 2001 7:39 am by Lee Daniel Crocker [Making more sensible language recommendations.]
	Revision 14 . . December 14, 2001 5:03 am by Lee Daniel Crocker ["an appropriate"]
	Revision 13 . . December 14, 2001 4:59 am by Taw [what is anappropriate ?]
	Revision 12 . . December 13, 2001 11:53 am by (logged).17.237.xxx [Moved list of algorithms; de-emphasized Unix ]
	Revision 11 . . (edit) December 13, 2001 6:41 am by (logged).253.39.xxx [added hash table algorithms]
	Revision 10 . . December 13, 2001 2:28 am by AxelBoldt [+ square root, +Euclidean algorithem, Fast Fourier Transform link, one-line descriptions]
	Revision 9 . . December 13, 2001 2:13 am by The Anome [added FFT - a beautiful algorithm]
	Revision 8 . . December 13, 2001 2:11 am by The Anome [put in link for perfect hashing, a cool algorithm...]
	Revision 7 . . (edit) December 13, 2001 2:08 am by (logged).103.96.xxx [+linear search (it's trivial, but you gotta start somewhere)]
	Revision 6 . . December 13, 2001 1:12 am by Damian Yerrick *[Can't avoid all recursion; replace tail* recursion with iteration]**
	Revision 5 . . December 12, 2001 8:25 am by Taw [using iteration is < s/prefered/usually prefered/ > over using recursion because this is more popular way of coding]
	Revision 4 . . December 12, 2001 7:46 am by Taw [Exponentiating by squaring]
	Revision 3 . . December 12, 2001 7:35 am by Taw [some algorithms]
	Revision 2 . . (edit) December 12, 2001 7:29 am by BenBaker
	Revision 1 . . December 12, 2001 7:07 am by Taw [draft of hints for good sample implementations of algorithms for Wikipedia,Further discussion is invited. ]

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

Changed: 13,14c13,18

Languages with a small user base like Ruby, Smalltalk or Eiffel are discouraged,
though Ruby does have the advantage of being quite readable.

Languages with a small user base like Smalltalk or Eiffel are discouraged.

There is some controversy about sample implementations in Ruby and pseudocode.
Ruby has an advantage of being very readable and a disadvantage of not being very popular.
Some people prefer pseudocode, because algorithm in pseudocode isn't obfuscated by implementation details.
This is major advantage as compared to some languages (like C), but is very small as compared to others (like Python and Ruby). Other arguments against pseudocode are that it's not standardized and is hard to test.