GATE CSE
First time here? Checkout the FAQ!
x
0 votes
89 views
Quicksort is ________ efficient than heapsort in the worst case.
asked in Algorithms by Veteran (76k points)   | 89 views

1 Answer

+3 votes
Best answer

Answer is LESS

as worst case time for Quicksort is O(n2) and worst case for heap sort is O(nlogn)

answered by Boss (9.2k points)  
selected by


Top Users Mar 2017
  1. rude

    4018 Points

  2. sh!va

    2994 Points

  3. Rahul Jain25

    2804 Points

  4. Kapil

    2606 Points

  5. Debashish Deka

    2092 Points

  6. 2018

    1414 Points

  7. Vignesh Sekar

    1318 Points

  8. Bikram

    1218 Points

  9. Akriti sood

    1166 Points

  10. Sanjay Sharma

    1004 Points

Monthly Topper: Rs. 500 gift card

21,439 questions
26,753 answers
60,919 comments
22,929 users