A Sorting Algorithm Is Stable If Elements With Equal Keys

A sorting algorithm is stable if elements with equal keys are left in the same order as they occur in the input. Which of the sorting algorithms in this chapter are stable and which are not? Why?

Posted in Uncategorized