Comments by "TheEVEInspiration" (@TheEVEInspiration) on "Creel" channel.

  1. This brings me so back to the 90s :)
    3
  2. Kind of misleading in terms of framing the problem. One still needs extra memory storage to store the final result.
    2
  3. Good point IMO, but in practice it will not be digits, but 8 or 16 bits at a time being looked at (reducing the number of iteration sharply). It also does require detection where the "larger numbers" start mixing into the already sorted "lower numbers". Another way to do it is to see if a critical number of elements in the input is already sorted and stream these out as being "done". Then compacting the array by removing the numbers that got pushed out, and only then resume normal radix sort iterations on what is left in the array.
    1