Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
ww520
83 days ago
|
parent
|
context
|
favorite
| on:
Faster binary search: from compiled code to mechan...
For small arrays that can fit in L1 cache, it's ok to do more loops. For bigger arrays, cache miss could remove all the gains.
pkhuong
83 days ago
[–]
Regardless of the array's size, the expected win from early exit on random keys is a constant number of iterations.
Consider applying for YC's Winter 2027 batch!
Applications
are open till November 2.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
