Q478
What is the best case time complexity of bead sort (S = sum of input elements)?
A.
O(n)
AnswerB.
O(S)
C.
O(n2)
D.
O(n log n)
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board