Which of the following sorting algorithm is stable?
(a) Selection sort
(b) Quick sort
(c) Tree sort
(d) Heap sort
I had been asked this question in semester exam.
I'd like to ask this question from Sorting in chapter Sorting of Data Structures & Algorithms II