Hashed sorting is typically faster than hash tables

Benchmarks and theoretical explanation of why and when hashed radix sort beats hash tables.