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
Answer: Option B
This Question Belongs to Data Structure >> Sorting Algorithms
Related Questions on Sorting Algorithms
What is the time complexity of Bubble Sort in the average case?
A. O(n log n)
B. O(n)
C. O(n2)
D. O(n3)
Which sorting algorithm is based on the divide-and-conquer strategy?
A. Insertion Sort
B. Quick Sort
C. Selection Sort
D. Insertion Sort
Which sorting algorithm uses a "pivot" element to partition the array into sub-arrays?
A. Merge Sort
B. Heap Sort
C. Counting Sort
D. Quick Sort
Join The Discussion