Question: ( More Recursions ) ( 3 2 points = 4 each ) Like in many previous exercises and homework's, find tight asymptotic bounds ( big

(More Recursions)(32 points =4 each) Like in many previous
exercises and homework's, find tight asymptotic bounds (big-Theta) for T(n) is
each of the cases. \\\\
$ T(n)=2T(n/4)+ n^2\sqrt{n}$\\\\
$ T(n)= T(n -1)+\frac{1}{n}$\\\\
$T(n)=1600T(n/4)+n!$ (hint: answering this shouldn't require too many,
if any, difficult calculations)\\\\
$ T(n)=6T(n/3)+\frac{n^4}{log^{25}(n)}$ (hint: answering this shouldn't require too many, if any, difficult calculations)\\\\
$ T(n)=\sqrt{n}T(\sqrt{n})+ n$ (hint: when everything fails, you guess and check)\\\\
$ T(n)= T(n/2)+ n(5- cos^2(n) sin^{20}(n))$ (hint: answering this shouldn't require too many, if any, difficult calculations, just think the most basic trigonometric inequality)\\\\
$T(n)=\alpha T(n/4)+\frac{n}{2}$ (hint: your answer should depend on the $\alpha$ parameter)\\\\
$T(n)=5T(n/5)+\frac{n}{log_5(n)}$ (hint: think of n =5m. Also the recursion $T(n)= T(n -1)+\frac{1}{n}$ above may come in handy.)\\\\

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!