Vidyalelo
Data Structure · Q435

Sorting Algorithms

Programming · Data Structure · question 435

Q435

In which of the following case pigeonhole sort is most efficient?

A.
when range of input is less than number of elements
B.
when range of input is more than number of elements
C.
when range of input is comparable to the number of elements
Answer
D.
when the given array is almost sorted

Answer: Option C

Solution

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