3 ms·The n log n bound is for comparison sorts, which Radix Sort is not an instance of.by pdpi 7y agoThe n log n bound is for comparison sorts, which Radix Sort is not an instance of.