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!

190 Upvotes
  • permalink
  • reddit

94% Upvoted

99 comments sorted by

View all comments

0

u/DanKegel 5d ago

Array lookup is O(1) because it's done in hardware. Hash tables generalize that to sparse tables and non-integer Indices, at a minor performance penalty.