All Questions
2 questions
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 ...
1
vote
1
answer
67
views
How do I find running time for the following divide and conquer problem?
Question is to find the runtime $T(n)$ of following problem by solving the recurrence.
$T(n)=16\cdot T(\frac{n}{4}) + n!$.
I went through the following theory.
If the recurrence relation is of the ...
- 279k