Which of the following sorting techniques is stable?
(a) quick sort
(b) counting sort
(c) heap sort
(d) selection sort
I have been asked this question in a national level competition.
My doubt stems from Sorting topic in section Sorting of Data Structures & Algorithms II