A sorting technique is called stable if

A

If it takes $$O(n \log n)$$ time

B

It uses divide and conquer technique

C

Relative order of occurrence of non-distinct elements is maintained

D

It takes $$O(n)$$ space