8 A radix sort has runtime complexity of nd where n is the n

8. A radix sort has runtime complexity of (nd) where n is the number of values and d is the number of digits in each key. This is typically much better than the (n lg n) performance of either Quicksort or Heapsort. Is there some drawback to radix sorting that prevents it from widespread use?

Solution

Yes.Find below drawbacks:

1.Radix sort takes more memory/space than other algorithms .
2.Radix sort depends on digits and letters which is less flexible. So it takes more time ni reWriting sublists.It never compares elements against each other.