14 votes 14 votes Quicksort is ________ efficient than heapsort in the worst case. Algorithms gate1988 algorithms sorting fill-in-the-blanks easy + – go_editor asked Dec 10, 2016 • retagged Jan 6 by Hira Thakur go_editor 2.8k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 22 votes 22 votes Answer is LESS. As worst case time for Quicksort is $O(n^2)$ and worst case for heap sort is $O(n \log n)$. Pavan Kumar Munnam answered Dec 10, 2016 • edited Jun 25, 2018 by Pooja Khatri Pavan Kumar Munnam comment Share Follow See all 0 reply Please log in or register to add a comment.
4 votes 4 votes http://www.geeksforgeeks.org/when-does-the-worst-case-of-quicksort-occur/ http://www.geeksforgeeks.org/where-is-heap-sort-used-practically/ answer : less Pronomita Dey 1 answered Aug 23, 2017 Pronomita Dey 1 comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes Less efficient rishu_darkshadow answered Oct 5, 2017 rishu_darkshadow comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Quick sort is less efficient that heap sort because quick sort takes O(n^2) while heap sort takes O(nlogn). ankit3009 answered Jan 8, 2021 ankit3009 comment Share Follow See all 0 reply Please log in or register to add a comment.