BiDS Again
- hashes very powerful
- work kind of like a dictionary or a phone book
- store and retrieve an item via a key
- work somewhat like sets
- enforce uniqueness
- can fetch keys (names)
- can fetch values (phone numbers)
- can iterate through either or both
- essentially unordered
- fast lookup, usually O(1) or constant
Slide 34 of 47