Revision as of 10:08, 18 January 2015 edit Christian75 (talk \| contribs) Extended confirmed users, New page reviewers, Pending changes reviewers, Rollbackers 117,722 edits Assessment: +Computer science (assisted) ← Previous edit		Revision as of 19:00, 29 November 2015 edit undo Rcgldr (talk \| contribs) Extended confirmed users 2,505 edits →Sample code Next edit →
Line 89: I intend to remove the sample implementations section if and when [[:Wikipedia:Articles for deletion/Insertion sort implementations]] is successful. It may be worthwhile to transwiki them to WikiBooks, WikiSource, or the Literate Programming wiki if anyone feels strongly about them. —<tt>[[User:donhalcon\|donhalcon]]</tt><sup>[[User talk:donhalcon\|╤]]</sup> 06:09, 5 March 2006 (UTC) : That AFD was successful, but there are still a couple of sample implementations. What's going on with requiring references for sample code in articles? -- [[User:Mikeblas\|Mikeblas]] 15:43, 5 September 2007 (UTC) *Despite the 2006 debate, sample implementations in the form of pseudo code to explain algorithms are part of both insertion sort and selection sort articles. Many other wiki articles use pseudo code as a method to explain algorithms in general, sorting, data compression, error correction code, data encryption, extended Euclidean algorithm, ... . I don't see why merge algorithm should be singled out for not having at least some explanation of the algorithm in the form of pseudo code. [[User:Rcgldr\|Rcgldr]] ([[User talk:Rcgldr\|talk]]) 19:00, 29 November 2015 (UTC) ==BEST KNOWN MERGE ALGORITHM==

Talk:Merge algorithm: Difference between revisions