Examveda

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))

D. O(n log n)

Answer: Option C


This Question Belongs to Data Structure >> Sorting Algorithms

Join The Discussion

Related Questions on Sorting Algorithms