Design and Analysis of Algorithms - Old Questions
5. Solve the following recurrence relations using master method. (2.5+2.5)
a. T(n)=7T(n/2)+n2
b. T(n)=4T(n/4)+kn
5 marks
|
Asked in 2076 (new)