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 recurrence-relation
Search options not deleted
user 71238
a definition of a sequence where later elements are expressed as a function of earlier elements.
2
votes
Accepted
What recurrence describes the time complexity of this algorithm?
Partial answer: The problem admits an $O(n^{\log_3(2)}) \leq O(n^{0.631})$ algorithm.
The algorithm $\mathcal A$ works as follows:
Query $x = A[n/3]$ and $y = A[2n/3]$.
If $x = y$, return $\max \{x, …
- 1,536