Content deleted Content added
MalnadachBot (talk | contribs) m Fixed Lint errors. (Task 12) |
WOSlinkerBot (talk | contribs) m Fix misnested tag lint errors |
||
Line 592:
It may be the case that it is only a theorem for sorting networks, and my lecturer just intended us to use it as a heuristic test to see if a sorting algorithm seems correct. Still, can anyone provide any further insight into this, such that we might be able to add something to the article about it? — [[User:Smjg|Smjg]] ([[User talk:Smjg|talk]]) 17:42, 30 November 2013 (UTC)
:{{Reply|Smjg}} A little late for this, but if you do manage to find a reliable source explaining this, I'm sure it could be integrated into the article. – [[User:FenixFeather|<font color="SlateBlue">'''''FenixFeather'''''</font>]] <sup>[[User_talk:FenixFeather|<font color="SlateBlue">(talk)
:: That's kinda obvious.... — [[User:Smjg|Smjg]] ([[User talk:Smjg|talk]]) 14:52, 12 April 2014 (UTC)
Line 614:
What should be done about this? My recommendation is to remove sorting networks from the chart entirely and only refer to them as a concept that can be applied to many sorting algorithms (AKS, even-odd, bitonic, bubble and insertion, etc.), either to construct hardware or to make an algorithm for fixed-size data sets. <small><span class="autosigned">— Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:BonzaiThePenguin|BonzaiThePenguin]] ([[User talk:BonzaiThePenguin|talk]] • [[Special:Contributions/BonzaiThePenguin|contribs]]) 03:40, 11 April 2014 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot-->
: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)
== Explanation of Comparison Sort methods ==
| |||