Register

recurrence equation

193 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
pk14697 asked Jul 2, 2018
333 views
Recurrence Equation
To prove that the time complexity of equation T(n) = T(α n) + T((1 – α)n) + βn is Θ(n logn).
To prove that the time complexity of equationT(n) = T(α n) + T((1 – α)n) + βnisΘ(n logn).
User Avatar
1 votes
1 votes
2 answers
2
iarnav asked Mar 30, 2018
2,463 views
#Algorithms Solve this recurrence equation only by using Recursion Tree method
T(n) = 2T(n/2) + C
T(n) = 2T(n/2) + C
User Avatar
4 votes
4 votes
0 answers
3
Aakanchha asked Jan 8, 2018
833 views
Recurrence equation
What is the highest upper bound time complexity for the following recurrence equation: $T(n)=4T\left ( \frac{n}{2} \right ) +n^{2}2^{\frac{1}{2}}$
What is the highest upper bound time complexity for the following recurrence equation: $T(n)=4T\lef...
User Avatar
Link Copied!