In which of the following case stooge sort is most efficient (in terms of time complexity)?
(a) when input array is already sorted
(b) when input array is reverse sorted
(c) when input array is large
(d) it has the same time complexity in any case
I have been asked this question in homework.
Origin of the question is Sorting in section Sorting of Data Structures & Algorithms II