Question

    Consider the following sorting algorithms.

    I. Quicksort II. Heapsort III. Mergesort

    Which of them perform in least time in the worst case?

    A I and II only Correct Answer Incorrect Answer
    B II and III only Correct Answer Incorrect Answer
    C III only Correct Answer Incorrect Answer
    D I , II, III Correct Answer Incorrect Answer
    E None of the above Correct Answer Incorrect Answer

    Solution

    The correct answer is B

    Practice Next