GATE CSE
First time here? Checkout the FAQ!
x
0 votes
85 views
Quicksort is ________ efficient than heapsort in the worst case.
asked in Algorithms by Veteran (75.6k points)   | 85 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.1k points)  
selected by
Top Users Feb 2017
  1. Arjun

    4898 Points

  2. Bikram

    4102 Points

  3. Habibkhan

    3748 Points

  4. Aboveallplayer

    2986 Points

  5. sriv_shubham

    2288 Points

  6. Smriti012

    2222 Points

  7. Arnabi

    1946 Points

  8. Debashish Deka

    1920 Points

  9. mcjoshi

    1614 Points

  10. sh!va

    1462 Points

Monthly Topper: Rs. 500 gift card

20,793 questions
25,951 answers
59,557 comments
21,976 users