Vidyalelo
Data Structure · Q177

Sorting Algorithms

Programming · Data Structure · question 177

Q177

What is the advantage of radix sort over quick sort?

A.
radix sort performs better than quick sort when we have log n bits for every digit
Answer
B.
radix sort has lesser space complexity
C.
radix sort is not a comparison based sorting technique
D.
radix sort has better cache performance than quick sort

Answer: Option A

Solution

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