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


Top Users Apr 2017
  1. akash.dinkar12

    3660 Points

  2. Divya Bharti

    2580 Points

  3. Deepthi_ts

    2040 Points

  4. rude

    1966 Points

  5. Tesla!

    1768 Points

  6. Debashish Deka

    1614 Points

  7. Shubham Sharma 2

    1610 Points

  8. Prashant.

    1492 Points

  9. Arjun

    1472 Points

  10. Arunav Khare

    1464 Points

Monthly Topper: Rs. 500 gift card

22,088 questions
28,063 answers
63,298 comments
24,173 users