Answer to Question #52161 in Programming & Computer Science for irebami

Question

Which of the following sorting algorithms maintain the relative order of records with equal keys?

Quicksort
Stable
Mergesort
Unstable

Answer 1

b.Stable
Stability: stable sorting algorithms maintain the relativeorder of records with equal keys (i.e. values). That is, a sorting algorithm is stable if whenever there are two records R and S with the same key and with R appearing before S in the original list, R will appear before S in the sorted list.