title: When to use non-comparison sorting over comparison sorting
body: <p>In class we learned about a bunch of new non-comparison sorts for the sake of avoiding the lower bound of <code>omega(nlogn)</code> for all comparison based sorts. But what was a  bit unclear to me was the pro's and con's to when to use which family of sorting algorithms.</p>
  
  <p>Can't any data set be tweaked so that non-comparison sorting algorithms (radix, bucket, key-indexed) can be used? If so, what's the point of comparison sorts even existing?</p>
  
  <p>Sorry for this being such a rudimentary question, but I really can't find anything online.</p>