Which of the following algorithm implementations is similar to that of an insertion sort?
(a) Binary heap
(b) Quick sort
(c) Merge sort
(d) Radix sort
I had been asked this question in an online interview.
Asked question is from Insertion sort topic in chapter Sorting of Data Structures & Algorithms II