Talk:List of algorithms

From Wikipedia, the free encyclopedia

Contents 1 algorithms described in Wikipedia 2 bogo-sort/stupid-sort 3 Other algorithms 4 method of generating most-perfect magic squares of order 2n 5 List the Algo categories by alphabetical order? 6 Another resource for mining.... 7 Is there a List of Algorithm Performances?

[edit] algorithms described in Wikipedia

The following is a list of the algorithms described in Wikipedia.

Perhaps I am mistaken about the purpose of this page, but I think algorithms that are not (yet) described in Wikipedia should not be in this list. I removed the following articles:

• • Breadth first search
  • Depth first search
  • Random search: actually exists
  • Predictive search: binary like search which factors in magnititude of search term versus the high and low values in the search. Sometimes called a dictionary search.
  • Sequential search
  • Select sort for loop with a nested for loop

Sorry if I'm mistaken.

-- CYD

I totally disagree. One of the key concepts of a wiki is that page authors can mention articles that do not yet exist. This prompts other authors who know about topic to create it. IE: It lets the reader (and thus potential author) know that there is a desire for that article. Also, I think the items should be in the list. Its a list. Its information in-and-of itself. By removing them, you imply that the algorithms themselves don't exist. Rlee0001 01:15 Oct 18, 2002 (UTC)

It seems from a quick inspection that quite a few of these articles talk about the algorithm without actually specifying it (eg Bresenham's line algorithm). I was under the impression that the latter was the intent of this page: am I wrong? Phil 16:00, Nov 4, 2003 (UTC)

Also those algorithms should be added, that don't exist in Wikipedia yet, to initiate someone to write it. Steven 82.82.117.221 16:03, 4 Nov 2003 (UTC)

---

I assume this is a 'List of Algorithms' that simply link to other algorithms. These algorithms, unless I'm mistaken, should also be added:Simplex_algorithm, Knuth-Morris-Pratt_algorithm, and Edmonds-Karp_algorithm

Indefual 19:32, 2003 Dec 6 (UTC)

---

Note that there's a lot of overlap between Topics in cryptography and the crypto part of this page. --Tromer 06:32, 2004 Feb 22 (UTC)

---

I want to add a page that I created (Floyd's cycle-finding algorithm) but I can't decide which category it should be in. I would assume it should be in the Numerical section, but I just wanted confirmation. --Decrypt3 09:04, May 22, 2004 (UTC)

I added it at the bottom; it's a general combinatorial thingy, really. Charles Matthews 09:22, 22 May 2004 (UTC)

[edit] bogo-sort/stupid-sort

if you let these in, you might as well let anyone come up with bogus algorithms. then how about something like this...

i don't sort sort: Here is the pseudocode of the algorithm:

 function i_dont_sort_sort(array)
   return(array)

(prerequisites: data must be sorted to begin with)

[edit] Other algorithms

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! 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. --MarkSweep 01:34, 16 July 2005 (UTC)

[edit] method of generating most-perfect magic squares of order 2ⁿ

• Halló! method of generating most-perfect magic squares of order 2ⁿ 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 Gangleri | Th | T 11:36, 9 August 2005 (UTC)

[edit] List the Algo categories by alphabetical order?

What do you think about keeping the category list in alpha order to make it simpler to find algorithms? Daniel.Cardenas 00:48, 27 January 2006 (UTC)

They are in alphabetical order. Deco 02:08, 27 January 2006 (UTC)

[edit] Another resource for mining....

Dictionary of Algorithms and Data Structures - http://www.nist.gov/dads/terms.html del.icio.us / tag / algorithms - http://del.icio.us/tag/Algorithms

[edit] Is there a List of Algorithm Performances?

Hello,

I had a quick look and couldn't find a listing of the different performances (eg Big-O, worst case etc) for each algorithm, does one exist somewhere?

if not i might start it....

thanks 129.78.208.4 08:45, 1 December 2006 (UTC)