Vidyalelo
Data Structure · Q381

Sorting Algorithms

Programming · Data Structure · question 381

Q381

What is the average time complexity of pigeonhole sort (k=range of input)?

A.
O(n)
B.
O(n+k)
Answer
C.
O(n2)
D.
O(n*k)

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board