NeatSort - A practical adaptive algorithm — mentioned by Robotbeat

Tue, 25 Jun 2019 13:43:06 GMT

For many classes of algorithms, the speed-up is actually better than Moore's Law. I don't think it's really an exaggeration to say that optimization of the programs can lead to 100x performance improvements. Sorting algorithms, for instance, improved dramatically from the first computer algorithms in the early 50s (yay Bubblesort) to QuickSort in the 1960s to newer algorithms in the 1980s/90s like Melsort, and even algorithms being written today, like Neatsort: https://arxiv.org/abs/1407.6183 And the thing about algorithms is that for certain problems and large n, they can quickly blow up.…

Paper and discussion history. A mention is not an endorsement.

NeatSort - A practical adaptive algorithm · HackerPapers discussions

NeatSort - A practical adaptive algorithm — mentioned by Robotbeat