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 master-theorem
Search options not deleted
user 53921
Questions on the Master theorem, a method for obtaining asymptotic bounds on recurrences of a specific form.
2
votes
3
answers
308
views
Asymptotic equivalent of the recurrence T(n)=3⋅T(n/2)+n
The questions is to find the running time $T(n)$ of the following function:
$$T(n)=3\cdot T(n/2) + n \tag{1}$$
I know how to solve it using Master theorem for Divide and Conquer but I am trying to s …
