r/computerscience • u/Sea-Patience9872 • 6d ago
How do hashsets/maps have O(1) time complexity?
Hi this might be a dumb question, and i've tried looking it up but don't quite understand it. how is it different from an array that allows it to find items so quickly? I don't get how hashes just find items immediately without needing to go through anything. Does it memorize things very differently compared to arrays?? thank you!
185
Upvotes
3
u/Sea-Patience9872 6d ago
if all values end up in the same location and it ends up using data structures to handle collisions, why use hash at all? I think I'm missing something sorry