Vidyalelo
Data Structure · Q476

Sorting Algorithms

Programming · Data Structure · question 476

Q476

What is the advantage of counting sort over quick sort?

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

Answer: Option A

Solution

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