Which of the following pair of sorting algorithms are stable?
(a) gnome sort and quick sort
(b) merge sort and selection sort
(c) gnome sort and merge sort
(d) heap sort and merge sort
I got this question by my college director while I was bunking the class.
I'd like to ask this question from Sorting in division Sorting of Data Structures & Algorithms II