Hacker News
- Binary Search: A new implementation that is up to 25% faster https://github.com/scandum/binary_search 54 comments
- Boundless Binary Search (v1.5) An up to 60% faster binary search implementation https://github.com/scandum/binary_search 13 comments programming
- 5 novel and faster binary search implementations https://github.com/scandum/binary_search 8 comments programming
Linking pages
- GitHub - scandum/quadsort: Quadsort is a branchless stable adaptive mergesort faster than quicksort. https://github.com/scandum/quadsort 456 comments
- GitHub - scandum/blitsort: Blitsort is an in-place stable adaptive rotate merge / quick sort https://github.com/scandum/blitsort/ 181 comments
- GitHub - scandum/gridsort: A stable adaptive partitioning comparison sort. https://github.com/scandum/gridsort 104 comments
Related searches:
Search whole site: site:github.com
Search title: GitHub - scandum/binary_search: A collection of improved binary search algorithms.
See how to search.