Content deleted Content added
→Sorting networks section still needs work: new section |
m Signing comment by BonzaiThePenguin - "→Sorting networks section still needs work: new section" |
||
Line 587:
"Sorting networks" aren't a singular algorithm that can be described as a single best/worst/average case for time and memory, but they're listed as such in the chart. They're also listed in a special category for sorts that are incredibly impractical or require special hardware. That may be true for the AKS sorting network it's apparently referring to, but small and efficient sorting networks are actually a ''lot'' faster than insertion sort, even though insertion sort is credited as being the fastest. In my experience they're anywhere from 2 to 5 times faster than insertion sort.
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-->
| |||