A stable sorting algorithm:
A. does not crash.
B. does not run out of memory.
C. does not change the sequence of appearance of elements.
D. does not exists.
Answer:C
A stable sorting algorithm:
A. does not crash. B. does not run out of memory. C. does not change the sequence of appearance of elements. D. does not exists.