Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with binary-search
Search options answers only
not deleted
user 94163
Questions about the binary search algorithm, which can be used to find elements of an ordered list in O(log n) time.
8
votes
Why is binary search using this weird thing to calculate middle?
Suppose your 'low' and 'high' are 16 bit unsigned integers.
That means, they can only have a maximum value of 2^16=65536.
Consider this,
low = 65530
high = 65531
If we added them first, (low+high) w …
