0
A sorting algorithm is said to be stable if it:
- AAlways runs in O(n log n) time
- BPreserves the relative order of elements with equal keys
- CUses only constant extra space
- DWorks only on already-sorted arrays
Correct answer: B
Discussion 0
Log in or create a free account to reply and vote.
Nobody has replied yet. Start the discussion!