Computer Science, asked by aadarsh9054, 1 month ago

which one of the following correctly determines the solution of the reccurence relation with T(1)=1. T(n)=2T(n2)+logn​

Answers

Answered by daneshkapasi
0

Answer:

The Questions and Answers of Which one of the following correctly determines the solution of the recurrence relation with T(1) = 1?T(n) = 2T(n/2) + Logna)(n)b)(nLogn)c)(n*n)d)(log n)Correct answer is option 'A'.

Similar questions