Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
elitheeli
on Aug 11, 2015
|
parent
|
context
|
favorite
| on:
How We Beat C++ STL Binary Search
If you take version 4, stop the first while loop once the size is at most 32, and then do linear search from there, it's faster (on my machine). For example, version 4 is 102ms and this tweak puts it at 83ms. (On clang x64.)
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: