- Python Basic Tutorial
- Python - Home
- Python - Overview
- Python - Environment Setup
- Python - Basic Syntax
- Python - Comments
- Python - Variables
- Python - Data Types
- Python - Operators
- Python - Decision Making
- Python - Loops
- Python - Numbers
- Python - Strings
- Python - Lists
- Python - Tuples
- Python - Dictionary
- Python - Date & Time
- Python - Functions
- Python - Modules
- Python - Files I/O
- Python - Exceptions
How do Python dictionary hash lookups work?
Dicts are hash tables. No tree searching is used. Looking up a key is a nearly constant time(Amortized constant) operation, regardless of the size of the dict. It creates the hash of the key, then proceeds to find the location associated with the hashed value. If a collision listed address is encountered, it starts the collision resolution algorithm to find the actual value.
This causes dictionaries to take up more space as they are sparse.
- Related Articles
- How can I convert Python dictionary to JavaScript hash table?
- How does Python dictionary keys() Method work?
- How do Python Dictionary Searching works?
- How do Python modules work?
- How do we define dictionary in Python?
- How do nested functions work in Python?
- How do list comprehensions in Python work?
- How do you Loop Through a Dictionary in Python?
- How do cookies work in Python CGI Programming?
- How do backslashes work in Python Regular Expressions?
- How do I serialize a Python dictionary into a string, and then back to a dictionary?
- Do you think Python Dictionary is really Mutable?
- How do muscles work?
- How do lungs work?
- How do map, reduce and filter functions work in Python?
Advertisements