Question

10. A sorting technique is called stable if it
(a) Takes O(n log n) times
(b) Maintains the relative order of occurrence of non-distinct elements
(C) Uses divide-and-conquer paradigm
(d) Takes O(n) space​

Answer 1

Answer:

Explanation:

7e95ditsktxotd