DSSB_2017

Question

A sorting algorithm is called stable if

1.It takes O(n log n) time

2.It maintains relative order  of occurrence of non-distinct elements

3.It uses divide and conquer paradigm

4.It takes linear time

Answer 1

The answer is (2) If it maintains relative order of occurrence of non-distinct elements

A sorting algorithm is said to be stable if two objects with equal keys appear in the same order in sorted output as they appear in the input unsorted array.

https://stackoverflow.com/questions/1517793/stability-in-sorting-algorithms