Content deleted Content added
m reply |
m add to WP:Lists |
||
| (56 intermediate revisions by 38 users not shown) | |||
Line 1:
{{WikiProject banner shell|class=List|1=
{{WikiProject Lists}}
{{WikiProject Computing|importance=}}
{{WikiProject Molecular Biology|COMPBIO=yes|COMPBIO-importance=mid}}
{{WikiProject Statistics|importance=low}}
}}
{{Broken anchors|links=
* <nowiki>[[Association rule learning#Zero-attribute rule|Zero-attribute rule]]</nowiki> The anchor (#Zero-attribute rule) is no longer available because it was [[Special:Diff/445101499|deleted by a user]] before. <!-- {"title":"Zero-attribute rule","appear":{"revid":429287314,"parentid":429287023,"timestamp":"2011-05-15T20:32:48Z","replaced_anchors":{"Zero-attribute-rule":"Zero-attribute rule"},"removed_section_titles":["Zero-attribute-rule"],"added_section_titles":["Zero-attribute rule"]},"disappear":{"revid":445101499,"parentid":445101413,"timestamp":"2011-08-16T05:13:21Z","removed_section_titles":["Zero-attribute rule"],"added_section_titles":[]}} -->
}}
__TOC__
== Spam under "Sequence alignment" heading ==
The "website review" link shouldn't be there, but I can't edit semi-protected pages yet. Anyone care to clean it up? [[User:ThomasTC|ThomasTC]] ([[User talk:ThomasTC|talk]]) 09:16, 7 July 2017 (UTC)
== algorithms described in Wikipedia ==
''The following is a list of the algorithms described in Wikipedia.''
Line 8 ⟶ 23:
** [[:Predictive search|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|Sequential search]]
** [[:
Sorry if I'm mistaken.
Line 36 ⟶ 51:
I added it at the bottom; it's a general combinatorial thingy, really. [[User:Charles Matthews|Charles Matthews]] 09:22, 22 May 2004 (UTC)
<br /><br />This link ( http://en.wikipedia.org/wiki/Sorting_algorithm ) has compared the speed and memory of various sorting algorithms. Should a smiliar table be done for this page?
[[User:Verycuriousboy|Verycuriousboy]] ([[User talk:Verycuriousboy|talk]]) 10:16, 27 December 2009 (UTC)
== 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)
== 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! [[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)
== 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)
== 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? [[User:Daniel.Cardenas|Daniel.Cardenas]] 00:48, 27 January 2006 (UTC)
:They are in alphabetical order. [[User:Deco|Deco]] 02:08, 27 January 2006 (UTC)
== 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
== 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 [[User:129.78.208.4|129.78.208.4]] 08:45, 1 December 2006 (UTC)
== Burstsort ==
Why isn't burstsort in the list? [[User:87.118.102.154|87.118.102.154]] 12:03, 5 July 2007 (UTC)
== Arithmetic ==
The list only provides a few links to arithmetic algorithms as practiced by humans and generally taught in [[traditional mathematics]]. Should this be added as a new category? Do pages describing these algorithms even exist? <small>—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/69.205.34.127|69.205.34.127]] ([[User talk:69.205.34.127|talk]]) 14:34, 19 February 2008 (UTC)</small><!-- Template:UnsignedIP --> <!--Autosigned by SineBot-->
:I've seen some of these around (e.g. in [[multiplication algorithm]] and [[elementary arithmetic]]) but it's certainly an area lacking coverage. [[User:Dcoetzee|Dcoetzee]] 21:54, 20 February 2008 (UTC)
== Why the self-reference? ==
This article seems to pretty blatantly violate [[WP:SELF|Wikipedia's policies against self-reference]]. Why? -- [[Special:Contributions/65.78.13.238|65.78.13.238]] ([[User talk:65.78.13.238|talk]]) 22:27, 14 December 2008 (UTC)
== Compiler Algorithms? ==
Were should compiler-oriented algorithms go? I see two choices -- a new top level section "Compiler Algorithms" or the same under "Software Engineering". I prefer the former, any opinions? [[User:Ergosys|Ergosys]] ([[User talk:Ergosys|talk]]) 03:33, 1 January 2009 (UTC)
== Contradiction on sort algorithms ==
The classification of sort algorithms into types here disagrees with the classifications at [[Sorting_algorithm#Comparison_of_algorithms]]. -- [[User:Beland|Beland]] ([[User talk:Beland|talk]]) 16:11, 29 August 2010 (UTC)
== Time and space complexity ==
It might be interesting to list the [[time complexity]] and [[space complexity]] for applicable algorithms, along the lines of [[Sorting_algorithm#Comparison_of_algorithms]]. -- [[User:Beland|Beland]] ([[User talk:Beland|talk]]) 16:36, 29 August 2010 (UTC)
== ''Search'' vs. ''shortest path'' algorithms? ==
The [[A*]] algorithm is listed as a graph search algorithm, while [[Dijkstra's algorithm]], which in fact is a special case of the A* algorithm, is listed as a shortest path finder. But what is really the difference between search algorithms and shortest path algorithms? May I suggest a merge of the two sections? —[[User:Kri|Kri]] ([[User talk:Kri|talk]]) 19:31, 22 August 2011 (UTC)
== Page request ==
I suggest creating a page on [[Computational complexity of common algorithms]] similar to [[Computational complexity of mathematical operations]], can serve as a very useful reference page to those comparing the computational complexity of an algorithm
([[User:Jalal0|Jalal0]] ([[User talk:Jalal0|talk]]) 09:55, 23 November 2011 (UTC)).
== More statistics algorithms ==
If no one has any objections, I'd like to add some things to the statistics section. My hesitation stems from whether they, universally, be considered algorithms, in the strictest sense of the word. For example, there are many methods for automated binning, like Freedman–Diaconis rule, and Doane's formula. Should I include these?
[[User:Statethatiamin|Statethatiamin]] ([[User talk:Statethatiamin|talk]]) 15:44, 27 April 2012 (UTC)
== External links modified ==
Hello fellow Wikipedians,
I have just modified one external link on [[List of algorithms]]. Please take a moment to review [https://en.wikipedia.org/w/index.php?diff=prev&oldid=792422995 my edit]. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit [[User:Cyberpower678/FaQs#InternetArchiveBot|this simple FaQ]] for additional information. I made the following changes:
*Added archive https://web.archive.org/web/20131006113018/http://glorfindel.mavrinac.com/~aaron/school/pdf/bay06_surf.pdf to http://glorfindel.mavrinac.com/~aaron/school/pdf/bay06_surf.pdf
When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.
{{sourcecheck|checked=false|needhelp=}}
Cheers.—[[User:InternetArchiveBot|'''<span style="color:darkgrey;font-family:monospace">InternetArchiveBot</span>''']] <span style="color:green;font-family:Rockwell">([[User talk:InternetArchiveBot|Report bug]])</span> 12:43, 26 July 2017 (UTC)
== Gale-Shapley algorithm ==
I provide here the evidences - for the sake of expediency - anyone:
findings were "marriage" is shown but sources indic. matching - part. the stable marriage problem is a type of matching problem. The fact: Teslet: p.32: Shapley & Roth won Nobel for Economics - applications of the algorithm indicated cannot be only: marriage.
*mathweb.ucsd.edu/~gptesler/154/slides/154_galeshapley_20-handout.pdf p.32 marriage shown as only one example of four
*www.cs.princeton.edu/~wayne/kleinberg-tardos/pdf/01StableMatching.pdf - doesn't even mention marriage
*web.stanford.edu/~ashishg/cs261/win21/notes/l5_note.pdf "We are going to study a classic problem, called the stable marriage problem. This is used in school choice, in resident matching, in network routers, and is one of the most beautiful matching problems." - doesn't exclude "matching" an shows mar. is sub of mat. (group in) mat.
[[User:Onemillionthtree|(𒌋*𓆏)𓆭]] 05:28, 26 April 2025 (UTC)
| |||