in Algorithms retagged by
1,315 views
0 votes
0 votes
$T(n) = 3 T (\frac{n}{4}) + n$
in Algorithms retagged by
1.3k views

2 Comments

I aam not able to find the genral term and not able to solve further please help and somebody explain this please 

0
0
dont go for lengthy methods. try to apply master theorem wherever possible. it will save ur time
0
0

1 Answer

0 votes
0 votes

Master’s Theorem .

Let a and b be positive constants and let T(n) = aT(n/b) + cn^k for n > b then

• if a > b^k then T(n) is Θ(n^ logb a )

• if a < b^k then T(n) is Θ(n^ k )

• if a = b^k then T(n) is Θ((n^ k )(log n))

T(n) = 3 T (n/4) + n

a=3 b=4 k=1

3<4^1 so case 2:

 T(n)=Θ(n)

4 Comments

my mam asked me to solve using iteration

using Iteration method only

so mam please solve by iteraiton method please
0
0
oh!! i was viewing it  from mcq angles
0
0
no mam please solve using iteration please please please
0
0
respected mam i am just a learner and started mam please tell me using iteration so that i can understand how to find complexity using iteration thats why mam please tell
0
0