in Algorithms
422 views
0 votes
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)$
in Algorithms
422 views

3 Comments

n^2.

By tree method im getting.
0
0
c)

T(N/4)<=T(N/2) USE THIS AND APPLY MASTER THEOREM
0
0
@UTKARSH JOSHI

CAN YOU SHARE THE TREE METHOD?
0
0

1 Answer

0 votes
0 votes
Option c)Theta(n^2) by  recursive tree method.

Related questions