No, because radix sort is not a comparison-based sort and is not O(n log n).

		dgreensp 3 months ago \| parent \| context \| favorite \| on: Hashed sorting is typically faster than hash table... No, because radix sort is not a comparison-based sort and is not O(n log n).