Seems the general consensus is that the quicksort is faster. For your situation? I don't know.
Yeah, I looked around at it as well. Looking at it algorithmically, the Quicksort O(n log n) is slower than Radix sort O(n*# of digits in the values) for small values. The advantage goes away as the values and array sizes get larger (pretty much any real world situation).
Real world, you don't get small fixed size integer numbers to sort. Apparently it's the overhead of managing things that also slows down the Radix sort vs Quicksort. Radix sort sure is a lot more work than Quicksort mentally speaking.
Real world, if I am sorting something, I've used Quicksorts 100% of the time. I haven't run into a situation where the time to figure out if another algorithm will give me extra performance was worth it. But that's just me and the programs I have been doing.