3 ms·Also, sorting is O(n), which is exactly what your perfect hash table would be, recursive.by KirinDave 8y agoAlso, sorting is O(n), which is exactly what your perfect hash table would be, recursive.