Which of the following sorting algorithm is stable?
(a) Selection sort
(b) Quick sort
(c) Binary insertion sort
(d) Heap sort
This question was addressed to me by my college professor while I was bunking the class.
The origin of the question is Sorting topic in portion Sorting of Data Structures & Algorithms II