GATE | GATE CS 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

Answer: (B)


Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up
Article Tags :

Be the First to upvote.

Please write to us at to report any issue with the above content.