6 ms·
You don't even need the amortized insertion. You know the max set size from the original list of items.
by haxton 7y ago
You don't even need the amortized insertion. You know the max set size from the original list of items.
- KirinDave 7y agoBut you don't get to pick the input type. What's your adaptive, non-probabilistic perfect hash function for all data types? I'm only aware of partial solutions to that problem, of which top down Radix sort is in fact one. But once you do that you don't need the table to solve the problem anyways, you've already got your discrimination function and you'd just pass that over the data. I cannot see why the tabular part of the hash table proposed solution is anything more than cargo culting.