Skip to content
Related Articles

Related Articles

GATE | GATE CS 1999 | Question 12
  • Last Updated : 06 Oct, 2017
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)

Explanation:

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

sudo-gate-course

My Personal Notes arrow_drop_up
Recommended Articles
Page :