GATE CSE
First time here? Checkout the FAQ!
x
0 votes
134 views
Quicksort is ________ efficient than heapsort in the worst case.
asked in Algorithms by Veteran (77.8k points)   | 134 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.6k points)  
selected by


Top Users Jun 2017
  1. Bikram

    3704 Points

  2. Arnab Bhadra

    1502 Points

  3. Hemant Parihar

    1502 Points

  4. Niraj Singh 2

    1481 Points

  5. junaid ahmad

    1432 Points

  6. Debashish Deka

    1384 Points

  7. Rupendra Choudhary

    1220 Points

  8. rahul sharma 5

    1220 Points

  9. Arjun

    1158 Points

  10. srestha

    1006 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 Jun 26 - Jul 02
  1. Arjun

    198 Points

  2. akankshadewangan24

    152 Points

  3. Debashish Deka

    138 Points

  4. Hira Thakur

    130 Points

  5. Soumya29

    104 Points


23,399 questions
30,111 answers
67,489 comments
28,424 users