
Designing Data-Intensive Applications – Storage and Retrieval
Coding Blocks
00:00
Is There a Hash Table?
On average, a hash table look up is o of one. So let's say that you had all thep in america, wriht, 330 million people. Wright, and let's say tha, they were in there twice. O of n is 660 million. We're saying that with this hash table, it's one. You go straight to the record on average, on average, ye. Now, there is worse case, right? We won't talk about it, but it's but so something you said, though, joe, is you said that this does not impact right performance. And i don't know if that's true. It might make sense to
Play episode from 36:34
Transcript



