Question

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

(c) Radix sort has higher values of constant factor in asymptotic notation

(d) Radix sort takes more space than quick sort

Radix sort people please answer.

Answer 1

Correct option is (b) Radix sort has better cache performance than quick sort

To explain: Quick sort has a better cache performance than radix sort. Radix sort also takes more space as compared to quick sort.