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