Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
ArkyBeagle
on July 23, 2016
|
parent
|
context
|
favorite
| on:
A Formal Verification of Rust's Binary Search Impl...
I believe ( (low>>1) + (high>>1) + ((low&1) & (high&1)) ) renders the desired result sans overflow.
Join us for
AI Startup School
this June 16-17 in San Francisco!
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
