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 72943
Questions about the binary search algorithm, which can be used to find elements of an ordered list in O(log n) time.
1
vote
How do I find maximum and minimum number of times the search loop will execute when searchin...
I assume your input is random and your array of size $N$, $A[1..N]$.
In case of binary search if the number you are searching for is located at $(1+N)/2$, i.e. right in the middle of the input array …
- 9,885
87
votes
Accepted
Why is the log in the big-O of binary search not base 2?
When you change the base of logarithm the resulting expression differs only by a constant factor which, by definition of Big-O notation, implies that both functions belong to the same class with respe …
- 9,885