Question: Question # 2 : Solve the following recurrences using Substitution method. i . T ( n ) = T ( n / 3 ) +

Question # 2: Solve the following recurrences using Substitution method.
i. T(n)= T(n/3)+ T(n-3)+ n
ii. T(n)=(n/8) T(n/8)+ lgn
iii. An = An1+ An2+ n
iv. An =2An2+ lgn
v. T(n)= T(n/4)+ T(n/2)+ n/2
Question # 3: Solve the following recurrences using Recursion tree method.
i. T(n)=2T(n/4)+ n^2
ii. An =2An/4+ n/2
iii. T(n)= T(n/4)+ T(n/6)+ n
iv. Fn= Fn4+2n
v.2an/4= an an/2 n/2
Question # 4: Solve the following recurrences using Master method.
i. Fn =4Fn/8+ n^2
ii. T(n)=4T(n/8)+ n^2.lgn
iii. T(n)=2T(n/2)+3T(n/3)+ n^2
iv. T(n)= T(n/2)+ n
v. An =2An/3+ n^3

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 Programming Questions!