Revision as of 00:16, 11 May 2014 edit GDallimore (talk \| contribs) 11,312 edits don't change other people's comments. Content unsuitable for talk page anyway ← Previous edit		Revision as of 16:59, 17 September 2014 edit undo 2620:36:8000:10:95b8:2d6c:17c9:12ab (talk) →Explanation of Comparison Sort methods: new section Next edit →
Line 606: :It doesn't seem like there is a reference supporting its position in the table, so if you have a good source that describes sorting networks as a strategy that can be applied to many different sorting algorithms, I think you could easily make that change. – [[User:FenixFeather\|<font color="SlateBlue">'''''FenixFeather'''''</font>]] <sup>[[User_talk:FenixFeather\|<font color="SlateBlue">(talk)]]</font></sup><sup>[[Special:Contributions/FenixFeather\|<font color="SlateBlue">(Contribs)]]</font></sup> 04:34, 11 April 2014 (UTC) == Explanation of Comparison Sort methods == I'd like to see an explanation of the terms used in the Method column of the Comparison Sorts table in the Comparison of Algorithms section: Partitioning, Merging, Selection, Insertion, Exchanging, Distribution, Random Shuffling. These don't seem to be explained until later in the article, if at all. I think a short paragraph or illustration describing these methods is warranted.[[Special:Contributions/2620:36:8000:10:95B8:2D6C:17C9:12AB\|2620:36:8000:10:95B8:2D6C:17C9:12AB]] ([[User talk:2620:36:8000:10:95B8:2D6C:17C9:12AB\|talk]]) 16:59, 17 September 2014 (UTC)

Talk:Sorting algorithm: Difference between revisions