GATE 1999

Question 12

A sorting technique is called stable if

A	it takes O (nlog n) time
B	it maintains the relative order of occurrence of non-distinct elements
C	it uses divide and conquer paradigm
D	it takes O(n) space

Question 12 Explanation:

Sorting techniques are said to be stable if it maintains the relative order of occurrence of non-distinct element.

Correct Answer: B

Question 12 Explanation:

Sorting techniques are said to be stable if it maintains the relative order of occurrence of non-distinct element.