0 votes 0 votes i mark the option D) but answer is A) Algorithms gateforum-test-series algorithms sorting time-complexity + – Prince Sindhiya asked Aug 23, 2018 edited Mar 12, 2019 by akash.dinkar12 Prince Sindhiya 514 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply MiNiPanda commented Aug 23, 2018 reply Follow Share 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. 2 votes 2 votes Prince Sindhiya commented Aug 23, 2018 reply Follow Share @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 0 votes 0 votes Please log in or register to add a comment.