Revision as of 23:16, 19 March 2016 edit 72.219.207.23 (talk) →Usage of bigO notation. "At least O(...)" ← Previous edit		Revision as of 23:17, 19 March 2016 edit undo SineBot (talk \| contribs) Bots 2,564,725 edits m Signing comment by 72.219.207.23 - "→Usage of bigO notation. "At least O(...)": " Next edit →
Line 742: 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">— 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-->

Talk:Sorting algorithm: Difference between revisions