Question

Which of the following is an advantage of recursive insertion sort over its iterative version?

(a) it has better time complexity

(b) it has better space complexity

(c) it is easy to implement

(d) it has no significant advantage

This question was posed to me in examination.

This interesting question is from Sorting in section Sorting of Data Structures & Algorithms II

Answer 1

The correct answer is (d) it has no significant advantage

The best I can explain: Recursive insertion sort has no significant advantage over iterative insertion sort. It is just a different way to implement the same.