PROBLEM:-
Which one of the following correctly determines the solution of the recurrence relation with T(1) = 1?
ANSWER:- A)O(N)
T(n) = 2T(n/2) + Logn
Options
This is dummy text. It is not meant to be read. Accordingly, it is difficult to figure out when to end it. But then, this is dummy text. It is not meant to be read. Period.
If you have any doubts then please let me know... ConversionConversion EmoticonEmoticon