Home/ Questions/Q 9125809
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-17T06:53:24+00:00

Possible Duplicate: How are Python’s Built In Dictionaries Implemented I am fairly new to

  • 0

Possible Duplicate:
How are Python’s Built In Dictionaries Implemented

I am fairly new to python and have a background in java. I was wondering whether the dictionary in python has the same search complexity as for hash maps in java. Example: searching for a key in a hash table/map in java is a constant time operation, I was wondering whether searching for a key in a dictionary in python is also a constant time operation. I have read through a few pages of python documentation regarding mapping but it doesn’t seem to indicate any hashing of keys of dictionary in python so I was wondering whether:

  1. searching keys in a dictionary in python was constant time operation.
  2. If so how do they achieve this constant time search without hashing?
Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    Python dictionaries have O(1) search complexity.

    See the Time complexity wiki page.

    Python dictionaries are implemented as a hash table, and keys are hashed; you can influence the hashing by implementing a __hash__ method.

    • 0