The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
108 views
T(n) = 2T(n/2) + nlogn

a. O(nlogn)

b.n(log^2n)

c.O(n^2)
in Algorithms by Active (1.7k points) | 108 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 (197 points)

Related questions

0 votes
0 answers
3
+1 vote
1 answer
4
asked Oct 15, 2017 in Algorithms by ashwina Active (1.7k points) | 133 views
+2 votes
1 answer
5
+1 vote
1 answer
6
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
49,833 questions
54,800 answers
189,502 comments
80,723 users