Gateforum Test Series: Algorithms - Sorting

Question

i mark the option D) but answer is A) 

Comments

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 n² time which is more than nlogn. That is why option A.

 

 

---

@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