A sorting algorithm is called stable if
- AIt takes O(n log n) time
- BIt maintains relative order of occurrence of non-distinct elements
- CIt uses divide and conquer paradigm
- DIt takes linear time
Correct answer: B
Discussion 0
Log in or create a free account to join the discussion.
Nobody has replied yet. Start the discussion!