Which of the following sorting algorithm has best case time complexity of O(n^2)?
(a) bubble sort
(b) selection sort
(c) insertion sort
(d) stupid sort
This question was posed to me in semester exam.
This interesting question is from Recursion topic in section Recursion of Data Structures & Algorithms II