## Gate-1988

Question 1 |

Quicksort is ________ efficient than heapsort in the worst case.

LESS. |

Question 1 Explanation:

As worst case time for quicksort is O(n

^{2}) and worst case for heap sort is O(n logn).
There is 1 question to complete.

Question 1 |

Quicksort is ________ efficient than heapsort in the worst case.

LESS. |

Question 1 Explanation:

As worst case time for quicksort is O(n^{2}) and worst case for heap sort is O(n logn).

There is 1 question to complete.