Vidyalelo
Data Structure · Q153

Sorting Algorithms

Programming · Data Structure · question 153

Q153

What is the average time complexity of bead sort (S = sum of input elements)?

A.
O(n)
B.
O(S)
Answer
C.
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