Which of the following sorting algorithm is stable?
(a) Tim sort
(b) Introsort
(c) Quick sort
(d) Heap sort
This question was addressed to me during an internship interview.
Origin of the question is Sorting in portion Sorting of Data Structures & Algorithms II