7 ms·Radix sort is not a comparison-based sort and is not O(n log n).by dgreensp 1y agoRadix sort is not a comparison-based sort and is not O(n log n).