Q432
Time complexity of sleep sort can be approximated to be . . . . . . . .
A.
O(n + max(input))
B.
O(n2)
C.
O(n log n + max(input))
AnswerD.
O(n log n)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board