The Gateway to Computer Science Excellence
+1 vote
111 views
T(n) = 2T(n/2) + nlogn

a. O(nlogn)

b.n(log^2n)

c.O(n^2)
in Algorithms by Active (1.8k points) | 111 views
0

O(nlog2 n )

+1

master's theorom  : a=1 b=1, k=1 p=1

a=b,p>-1

nlogbalogp+1n= nlog2n

0
This is the answer.

1 Answer

0 votes

https://gateoverflow.in/?qa=blob&qa_blobid=7420582609919252688

the question satisfies rule (ii-a)(see the pic), so answer is option -b

by (215 points)
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,741 questions
57,240 answers
198,004 comments
104,599 users