6 ms·No, because radix sort is not a comparison-based sort and is not O(n log n).by dgreensp 1y agoNo, because radix sort is not a comparison-based sort and is not O(n log n).