You know too much

added by DotNetKicks
8/24/2018 1:25:24 PM

1 Kicks, 1419 Views

He explained (in detail, and correctly) how hash maps work, that they rely on probability to ensure their O(1) guarantees and that he didn't feel that he could select such a data structure for O(1) performance before analyzing the distribution of the data and figuring out if there are too many expected collisions in the data set.