Talk:Algorithm: Difference between revisions

Revision as of 23:03, 17 April 2003

Revision as of 01:51, 14 August 2003

Line 156:

I had a thought on the subject of good examples -- how about the [[Tower of Hanoi]] algorithm? -- [[User:Tarquin|Tarquin]] 11:52 Jan 24, 2003 (UTC)

----

Ok, some of the problems with the opening paragraph:

*The definition of the algorithm was prefaced with generally, when broadly-defined was meant. The definition of the algorithm as presented may be restricted, but it is never excepted unless done so erroneously, so it makes sense to be more concise with the modifier.

*The term "list" has more of sequential association than does "set" as usually code is very non-linear. Take any assembly code for example and you get my point. Set, therefore, is more concise. I realize for non-computing applications such as a recipe, list is generally the norm, but it seems to me that set is equally understandable to lay persons.

*I added the byperlink <i>iteration</i> and the term decision with the links to Boolean logic and inequality because comparison and logic are the cornerstone of even the simplest cooking recipes.

*I changed mnemonics as an example of an alogorithm, because strictly speaking, a mnemonic device is NOT an algorithm. It is the data structure associated with an alogrithm, as the process of encoding and decoding the original information IS the algorithm. The phrase ROY G BIV is more an algorithm than an MP3 file. Both are the endproduct of a codec.

*The rest of it I just cleaned up the syntax for conciseness and clarity.

[[User:Jtvisona|jtvisona]] 01:51, 14 Aug 2003 (UTC)