Computer Science, asked by pradipika03, 7 months ago

Subject test
Note: -
You are attempting question 4 out of 12
Solve the recurrence relation T(n)= 2T(n/2)+nlgn
a) T(n) = (Ign)
b) Tín)= 2(algºn)
c) T(n) = 2(nlgºn)
d) T(n)= 2(xlg n)

Answers

Answered by shashibhasker2
0

Answer:

I think the answer is b

Explanation:

I Hope you have a good day

Similar questions