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
$ make; make bench$ make; make test-
Notifications
You must be signed in to change notification settings - Fork 1
varunpatro/fast-binary-search
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published