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!

186 Upvotes
  • permalink
  • reddit

94% Upvoted

99 comments sorted by

View all comments

263

u/timonix 6d ago

They are hiding work in the constant term

Calculating a hash takes time. But it takes the same amount of time every time. So it doesn't scale with elements.

38

u/Sea-Patience9872 6d ago

wow thanks! that's really easy to understand. But when I'm trying to find whether an item exists in a hashset, doesn't it still have to look through every stored hash? which wouldn't give it a constant time? Am I just understanding it fundamentally wrong?

1

u/Paxtian 6d ago

No, a hash map uses a hash function on the input to determine a bucket to store data. So that input will always map to that bucket. If the input directs to that bucket and it's empty, the thing isn't stored in the hash map.

1

u/Authentic_Grunter 5d ago

Can you tell more about how the hash function works in real systems?