| | Wolfsort: A stable adaptive hybrid radix / merge sort (github.com/scandum) |
| 1 point by thunderbong on Feb 11, 2024 | past |
|
| | Show HN: Wolfsort v3 – A fast hybrid Stalin sort (github.com/scandum) |
| 1 point by scandum on Feb 10, 2024 | past |
|
| | Show HN: Fluxsort, a stable Quicksort, faster and more adaptive than Timsort (github.com/scandum) |
| 4 points by scandum on Feb 18, 2023 | past | 2 comments |
|
| | Show HN: QuadSort, Esoteric Fast Sort (github.com/scandum) |
| 78 points by Exorust on Jan 29, 2023 | past | 23 comments |
|
| | A collection of array rotation algorithms (github.com/scandum) |
| 4 points by todsacerdoti on Dec 2, 2022 | past |
|
| | Blitsort: A fast, in-place stable hybrid merge/quick sort (github.com/scandum) |
| 202 points by scandum on Dec 1, 2022 | past | 88 comments |
|
| | Crumsort: Introduction to a new sorting algorithm faster than pdqsort (github.com/scandum) |
| 8 points by jasonbourne1901 on April 22, 2022 | past |
|
| | Fluxsort: A stable adaptive partitioning comparison sort (github.com/scandum) |
| 68 points by signa11 on July 25, 2021 | past | 18 comments |
|
| | Blitsort is an in-place stable adaptive rotate merge sort (github.com/scandum) |
| 109 points by signa11 on July 9, 2021 | past | 33 comments |
|
| | Blitsort is an in-place stable adaptive rotate merge sort (github.com/scandum) |
| 3 points by thunderbong on July 8, 2021 | past |
|
| | Gridsort: A stable sort faster than std:sort (github.com/scandum) |
| 45 points by signa11 on Feb 8, 2021 | past | 21 comments |
|
| | Wolfsort: An ultra-fast hybrid radix sort algorithm (github.com/scandum) |
| 102 points by scandum on July 23, 2020 | past | 27 comments |
|
| | Binary Search: A new implementation that is up to 25% faster (github.com/scandum) |
| 171 points by scandum on July 19, 2020 | past | 54 comments |
|
| | Quadsort: a stable non-recursive merge sort (github.com/scandum) |
| 312 points by geophertz on Feb 14, 2020 | past | 106 comments |
|
