Talk:Sorting algorithm: Difference between revisions

Revision as of 23:23, 19 March 2016

Revision as of 23:35, 19 March 2016

Line 744:

hsort is debuggable (unlike recursive heuristics, it's flow is mostly natural)

hsort also has implications in distributive computing because it can recurse dimensions and doesn't require merging or waiting per say (implementation of piping finished bins in 123 order aside which is easy, which is always true single process) <small class="autosigned">—&nbsp;Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/72.219.207.23|72.219.207.23]] ([[User talk:72.219.207.23|talk]]) 23:16, 19 March 2016 (UTC)</small><!-- Template:Unsigned IP --> <!--Autosigned by SineBot-->

Allowing an sssumption this hsort is faster in a worthy manner, it does matter in that scientific algorithms can finish or never finish depending on inner speed and many math algorithms have sorting at their core (for example, factoring); while for "web server technology" sorting might not be important - it is important whether scientific processes can finish and show a result, (which is simply re-iterating a textbook big-O-notation explination).

LASTLY. hsort algorithm is not an idea it's available for use (has other algo in a collection too) as a gnu-sort compatible program, and has a demo "mini sort" prog to make it's portability and use more clear.

<small class="autosigned">—&nbsp;Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/72.219.207.23|72.219.207.23]] ([[User talk:72.219.207.23|talk]]) 23:16, 19 March 2016 (UTC)</small><!-- Template:Unsigned IP --> <!--Autosigned by SineBot-->