Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
juliusgeo
on May 1, 2023
|
parent
|
context
|
favorite
| on:
Beating Bisect with Branchless Binary Search
That makes a lot of sense to me--I added another graph to the README which shows the performance at every size between 0 and 2*15, rather than just powers of two :). It is in images as "4.jpeg".
Consider applying for YC's Fall 2025 batch! Applications are open till Aug 4
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
