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
Quiz of this Question
Please comment below if you find anything wrong in the above post
Attention reader! Don’t stop learning now. Learn all GATE CS concepts with Free Live Classes on our youtube channel.