Comments by "disgruntledtoons" (@disgruntledtoons) on "Why is Radix Sort so Fast? Part 2 Radix Sort" video.

  1. But a radix sort requires an iteration for each digit in n, so a radix sort is ultimately n log n complexity. It's easy to miss this because the implementation will often assume the highest possible value of log n for the sake of coding simplicity and hard code it.
    2