Content deleted Content added
Horndude77 (talk | contribs) Other algorithms |
→Other algorithms: distinguish algorithms and problems |
||
Line 53:
I've been looking around on the wikipedia and it seems that there are many algorithms that are left off this list (e.g. [[Levenshtein_distance]], [[Longest-common subsequence problem]]). Has this page been deprecated by categories? (I still see value in this page as it adds short blurbs about the algorithms.) I'm asking because I'd like to add some of these, but I'm not sure where to put them without adding new sections (it seems a similar thing was discussed earlier). Ok, thanks! [[User:Horndude77|Horndude77]] 01:06, 16 July 2005 (UTC)
: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)
| |||