Question

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

(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

This question was posed to me by my college professor while I was bunking the class.

This intriguing question comes from Sorting in section Sorting of Data Structures & Algorithms II

Answer 1

Correct option is (a) radix sort performs better than quick sort when we have log n bits for every digit

Easy explanation - Radix sort performs better than quick sort when we have log n bits for every digit. But radix sort takes more space as compared to quick sort.