Which of the following is an advantage of recursive bubble 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
The question was asked by my college director while I was bunking the class.
This intriguing question comes from Sorting topic in section Sorting of Data Structures & Algorithms II