Q122
Which of the following sorting algorithm has best case time complexity of O(n2)?
A.
bubble sort
B.
selection sort
AnswerC.
insertion sort
D.
stupid sort
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board