title: Why quicksort is more popular than radix-sort?
body: <p>Why quicksort(or introsort), or any comparison-based sorting algorithm is more common than radix-sort? Especially for sorting numbers.</p>
  
  <p>Radix-sort is not comparison based, hence may be faster than O(n<em>logn). In fact, it is O(k</em>n), where k is the number of bits used to represent each item. And the memory overhead is not critical, since you may choose the number of buckets to use, and required memory may be less than mergesort's requirements.</p>
  
  <p>Does it have to do with caching? Or maybe accessing random bytes of integers in the array?</p>