812 views
0 0 votes
Given $T(n)=T(\frac{n}{4})+T(\frac{n}{2})+n^{2},$ then

$A)T(n)=\theta(n^{3})$                 $B)T(n)=\theta(n^{2}logn)$               $C)T(n)=\theta(n^{2})$                   $D)T(n)=\theta(n^{3}logn)$

1 Answer

Position:
Show:

Related questions

0 0 votes
1 1 answer
1.2k
1.2k views
practicalmetal asked Sep 15, 2023
1,202 views
Consider the following function:function X(n,r) { if(r==0 or n == r) then return 1; else return (X(n-1,r-1,) + X(n-1,r)); }Find the worst case time complexity of function...
1 1 vote
0 0 answers
663
663 views
NIHAR MUKHIYA asked Jul 15, 2017
663 views
T(n)=T(n/2+2)+nSolution using substitution method
0 0 votes
1 1 answer
976
976 views
iarnav asked May 25, 2017
976 views
According to gate CS, where is recurrence relations are used?How to learn to use them in Algorithms in solving T(n) Questions.Kindly mention the video lecture source to s...
1 1 vote
2 2 answers
697
697 views
learncp asked Jan 17, 2016
697 views
I am having some problems in calculating time complexities for recurrence relations. In one of the books, I saw two questions-1.A(n){if(n<=1) return (n);else{ return ( A(...