Vidyalelo
Data Structure · Q352

Sorting Algorithms

Programming · Data Structure · question 352

Q352

What is the advantage of pigeonhole sort over merge sort?

A.
pigeonhole sort has lesser time complexity when range is comparable to number of input elements
Answer
B.
pigeonhole sort has lesser space complexity
C.
counting sort is not a comparison based sorting technique
D.
pigeonhole sort is adaptive

Answer: Option A

Solution

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