## Data Structure Name: Hash Table - #### Description: - Uses a [[Hash Function]] to map [[Hash Keys]] to buckets, or more specifically: - When a new key is inserted, the hash function will decide which bucket the key should be assigned and the key will be stored in the corresponding bucket - When we search for a key, the hash table will use the same hash functions to find the corresponding bucket and only search in that bucket - #### Variations: - [[Hash Set ]]- no repeated values - Hash Map (Dictionary) - stores key-value pairs - #### Diagram: - #### General Use: ## Key Considerations - #### Properties: - Supports quick insertion and search - #### Implementation Details: - TBD | | [[Big O - Time Complexity]] | [[Big O - Space Complexity]] | | ------ | --------------------------- | ---------------------------- | | Access | | | | Add | | | | Delete | | | | Search | | | - #### General Tips - #### Special Properties ## Specific Use Cases - TBD