The Gateway to Computer Science Excellence
+7 votes
Quicksort is ________ efficient than heapsort in the worst case.
in Algorithms by Veteran (105k points)
retagged by | 687 views

3 Answers

+12 votes
Best answer

Answer is LESS.

As worst case time for Quicksort is $O(n^2)$ and worst case for heap sort is $O(n \log n)$.

by Boss (10.7k points)
edited by
+2 votes
Less efficient
by Loyal (7.3k points)

Related questions

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,737 questions
57,365 answers
105,260 users