Hacker News
- Show HN: QuadSort, Esoteric Fast Sort https://github.com/scandum/quadsort 23 comments
- Quadsort: a stable non-recursive merge sort https://github.com/scandum/quadsort 106 comments
- quadsort 1.1.5.1: Up to 2.5x faster than qsort() on random data https://github.com/scandum/quadsort 2 comments c_programming
- Quadsort 1.1.5.1: Introducing cost effective branchless merging https://github.com/scandum/quadsort 21 comments programming
- Quadsort: Introduction to a new stable sorting algorithm faster than quicksort https://github.com/scandum/quadsort 304 comments programming
Linking pages
- GitHub - scandum/crumsort: A branchless unstable quicksort / mergesort hybrid 33% faster than pdqsort. https://github.com/scandum/crumsort 257 comments
- GitHub - scandum/blitsort: Blitsort is an in-place stable adaptive rotate merge / quick sort https://github.com/scandum/blitsort/ 181 comments
- GitHub - scandum/fluxsort: A fast branchless stable quicksort / mergesort hybrid that is highly adaptive. https://github.com/scandum/fluxsort 139 comments
- GitHub - scandum/gridsort: A stable adaptive partitioning comparison sort. https://github.com/scandum/gridsort 104 comments
- GitHub - orlp/glidesort at a9bac7f27179d7d2d97ab6fdebbd42dd6477de3d https://github.com/orlp/glidesort/tree/a9bac7f27179d7d2d97ab6fdebbd42dd6477de3d 3 comments
- GitHub - mlochbaum/rhsort: Robin Hood Sort, for uniform data https://github.com/mlochbaum/rhsort 1 comment
- GitHub - andrew-young/tqsort: sorting algorithm combining ideas of quadsort and timsort https://github.com/andrew-young/tqsort 1 comment
- GitHub - nikitavoloboev/github-stars: Curated list of my GitHub stars https://github.com/nikitavoloboev/github-stars 0 comments
- Console #74 -- Tile38, Blitsort, and Air https://console.substack.com/p/console-74?r=3cbez 0 comments
Linked pages
- GitHub - scandum/crumsort: A branchless unstable quicksort / mergesort hybrid 33% faster than pdqsort. https://github.com/scandum/crumsort 257 comments
- GitHub - scandum/blitsort: Blitsort is an in-place stable adaptive rotate merge / quick sort https://github.com/scandum/blitsort/ 181 comments
- GitHub - scandum/fluxsort: A fast branchless stable quicksort / mergesort hybrid that is highly adaptive. https://github.com/scandum/fluxsort 139 comments
- GitHub - scandum/gridsort: A stable adaptive partitioning comparison sort. https://github.com/scandum/gridsort 104 comments
- GitHub - scandum/binary_search: A collection of improved binary search algorithms. https://github.com/scandum/binary_search 75 comments
- GitHub - scandum/wolfsort: Wolfsort is a stable adaptive hybrid radix / merge sort. https://github.com/scandum/wolfsort 27 comments
- GitHub - scandum/rotate: A collection of array rotation algorithms. https://github.com/scandum/rotate 12 comments
- GitHub - mlochbaum/rhsort: Robin Hood Sort, for uniform data https://github.com/mlochbaum/rhsort 1 comment
Would you like to stay up to date with C & C++? Checkout C & C++
Weekly.
Related searches:
Search whole site: site:github.com
Search title: GitHub - scandum/quadsort: Quadsort is a branchless stable adaptive mergesort faster than quicksort.
See how to search.