edited by
801 views
4 votes
4 votes
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}}$
edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
pk14697 asked Jul 2, 2018
322 views
To prove that the time complexity of equationT(n) = T(α n) + T((1 – α)n) + βnisΘ(n logn).
1 votes
1 votes
2 answers
2
1 votes
1 votes
0 answers
3
iarnav asked Jan 14, 2018
188 views
what is recurrence relation of harmonic number/series ? and it's time complexity