Q1.12MCQMarks unknownA sorting technique is called stable if(A)it takes O(nlogn)O (n \log n)O(nlogn) 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)O(n)O(n) spaceSign in to save attempts.Show answer← PreviousNext →SolutionsDiscussionLoading…Sign in with Google