Content deleted Content added
→Other algorithms: distinguish algorithms and problems |
No edit summary |
||
Line 1:
__TOC__
== algorithms described in Wikipedia ==
''The following is a list of the algorithms described in Wikipedia.''
Line 55 ⟶ 57:
:In general, lists can peacefully coexist with categories, as they serve different purposes. In the two specific cases you mention, I'm not sure I would include them here. Levenshtein distance is first and foremost a mathematical ''concept''. Its definition raises the question of how it can be computed efficiently; that's an algorithmic ''problem''. Finally, the standard dynamic programming algorithm for solving that problem is one solution among quite a few others (a well-known alternative is a recursive divide-and-conquer method). Such algorithmic solutions can and should of course be included in the present list. However, I'm not sure what to do about the underlying algorithmic problems and the more fundamental concepts involved in those problems. Similarly for the related longest common subsequence problem: it's primarily an algorithmic problem, for which there is more than one algorithmic solution. --[[User:MarkSweep|MarkSweep]] 01:34, 16 July 2005 (UTC)
== method of generating most-perfect magic squares of order 2<sup>n</sup> ==
* Halló! [[Talk:Most-perfect magic square#method of generating most-perfect magic squares of order 2n|method of generating most-perfect magic squares of order 2<sup>n</sup>]] is a draft about an algorithm and probably not following Wikipedia standards. I apologize for all spelling and editorial errors and would be happy of any review. It is a question to whom it should be attributed, if it was published in a similar form in modern times, described in ancient Indian of Jain texts etc. Best regards [[User:Gangleri|Gangleri]] | [{{SERVER}}{{localurl:User talk:Gangleri|action=history}} Th] | [[{{ns:User_talk}}:Gangleri|T]] 11:36, 9 August 2005 (UTC)
| |||