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