Vidyalelo
Data Structure · Q146

Sorting Algorithms

Programming · Data Structure · question 146

Q146

Which of the following is not true about radix sort?

A.
Radix sort performs better than quick sort when we have log n bits for every digit
B.
Radix sort has better cache performance than quick sort
Answer
C.
Radix sort has higher values of constant factor in asymptotic notation
D.
Radix sort takes more space than quick sort

Answer: Option B

Solution

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