fast-binary-search

This project will explore different techniques to make binary search run fast.

Some approaches (will be benchmarked)

[x] Naive

[ ] Conditional Move

[x] Code Generation

[x] Branchless

[ ] Heapified

to benchmark

$ make; make bench

to test

$ make; make test