title: If linear time sorting algorithms like Radix Sort exist, when do we need to use comparison sorts?
body: <p>Since all comparison sort algorithms take at least n lg n time, why would we ever need to use something like quicksort when we can express the items in the quicksort list as bits and using something like radix sort which is linear?</p>