Which one of the following is a variation of Heap sort?
(a) Comb sort
(b) Smooth sort
(c) Binary tree sort
(d) Shell sort
This question was posed to me in exam.
Question is taken from Heapsort topic in chapter Sorting of Data Structures & Algorithms II