The Gateway to Computer Science Excellence
0 votes
64 views

i mark the option D) but answer is A) 

in Algorithms by Loyal (5.6k points)
edited by | 64 views
+1

A) f(n)=Ω(nlogn) means f(n)>=c* nlogn

D) f(n)=O(nlogn) means f(n)<=c* nlogn which means that no comparison based algo takes more than nlogn time. But we know there are algo like bubble sort, worst case of quick sort etc that takes n2 time which is more than nlogn. That is why option A.

 

 

0
@minpanda yes i missed out this point thanxx for pointing it means we can say that in worst case it can not be less than nlogn ?

But please explain the question i am not getting it exactly

Please log in or register to answer this question.

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,666 questions
56,154 answers
193,758 comments
93,723 users