A sorting technique is called stable if

PYQ GATE 1999

A sorting technique is called stable if

  1. A.

    If it takes O(n log n) time

  2. B.

    It uses divide and conquer technique

  3. C.

    Relative order of occurrence of non-distinct elements is maintained

  4. D.

    It takes O(n) space

Attempted by 2030 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…