Fastest Branchless Binary Search

1. sb_lower_bound

   1 10 17 3.9 C++

   Fastest Branchless Binary Search

2. SaaSHub

   www.saashub.com featured

   SaaSHub - Software Alternatives and Reviews. SaaSHub helps you find the best software and product alternatives

   

3. zfs

   2 747 10,794 9.8 C

   OpenZFS on Linux and FreeBSD

   

   I implemented this in ZFS’ btree implementation a few years ago:

   https://github.com/openzfs/zfs/commit/677c6f8457943fe5b56d7a...

   It only works if the comparator is inclined, which is why I had to use a macro and duplicate the code everywhere. C++’s templates effectively do the same thing.

4. binary_search

   3 3 659 0.0 C

   A collection of improved binary search algorithms.

   Related repository of interest: https://github.com/scandum/binary_search

   "The most notable variant, the monobound binary search, executes two to four times faster than the standard binary search on arrays smaller than 1 million 32 bit integers."

Suggest a related project