A sorting technique is called stable if:

Question 23 options:

	It takes O(nlog n)time
	It maintains the relative order of occurrence of non-distinct elements
	It uses divide and conquer paradigm
	It takes O(n) space