Q123
What will be the best case time complexity of recursive selection sort?
A.
O(n)
B.
O(n2)
AnswerC.
O(log n)
D.
O(n log n)
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board