Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
Bulat_Ziganshin
on Jan 3, 2025
|
parent
|
context
|
favorite
| on:
Static search trees: faster than binary search
with m/t, the algorithm is memory-bound, so the performance should be determined strictly by the memory throughput
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: