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

1 Answer

+4 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.9k points)  
selected by


Top Users Aug 2017
  1. ABKUNDAN

    4660 Points

  2. Bikram

    4366 Points

  3. akash.dinkar12

    3258 Points

  4. rahul sharma 5

    3042 Points

  5. manu00x

    2682 Points

  6. makhdoom ghaya

    2410 Points

  7. just_bhavana

    2100 Points

  8. Tesla!

    1918 Points

  9. stblue

    1682 Points

  10. joshi_nitish

    1608 Points


24,928 questions
32,024 answers
74,385 comments
30,113 users