Which one of the following correctly determines the solution of the recurrence relation with T(1) = 1? ~ advance coding in data structures and algorithms c++

Uncategories Which one of the following correctly determines the solution of the recurrence relation with T(1) = 1?

Which one of the following correctly determines the solution of the recurrence relation with T(1) = 1?

PROBLEM:-

Which one of the following correctly determines the solution of the recurrence relation with T(1) = 1?

T(n) = 2T(n/2) + Logn

Options
O(N) 
O(NlogN)
O(N^2)
O(log N)

ANSWER:- A)O(N)

About Admin MC3

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.

Related Post

undefinedundefined
undefinedundefined
undefinedundefined
undefinedundefined

If you have any doubts then please let me know... ConversionConversion EmoticonEmoticon

:)

:(

=(

^_^

:D

=D

=)D

|o|

@@,

;)

:-bd

:-d

:p

:ng

Subscribe to: Post Comments (Atom)