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 20169
Questions about the binary search algorithm, which can be used to find elements of an ordered list in O(log n) time.
13
votes
Accepted
Proving that the average case complexity of binary search is O(log n)
I think most text book will provide you a good proof.
For me, I can show the average case complexity as follows.
Assuming a uniform distribution of the position of the value that one wants to find i …
- 839