A sorting technique is called stable if

PYQ GATE 1999

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 1978 students.