Computer Science, asked by veeraganeshlokavarap, 25 days ago

Solve the recurrence relation T(n)= 2T (n/2) + nlgn
a) T(n) = (lg n)
b) T(n) = 9(Algºn)
c) T(n) = 2(algºn)
d) T(n) = (nlg n)​

Answers

Answered by chauhanharendra4
0

Answer:

I study in 7 th class so I am not understanding

Similar questions