Comments by "Jkauppa" (@Jkauppa) on "The Sorting Algorithm Olympics - Who is the Fastest of them All" video.

  1. try hash sort, with hash values to assign to bins, ie, 5 bins, min=5, max=106, delta=106-5, binsize=delta/bins=101/5=20.2, first bin is roughly [5, 5+20]=[5, 26], then [26, 46], [46, 66], [66, 86], [86,106]. hash function is simply f(value)=(value-min)/delta, giving the bin index of 1-bins. very much like radix and merge sort, and quick sort, division sort. subsort each bin, until all bins have max 1 number, then print in order.
    1
  2. should be O(n) if you have quite large bins, but not so many that it becomes quick or merge sort, ie, halved the value array size each time, should be faster, if you have bin for each value, it might be possible to sort it all in one pass
    1