Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://mail.python.org/pipermail/python-dev/2008-March/077516.html below:

[Python-Dev] Complexity documentation request

• Previous message: [Python-Dev] Complexity documentation request
• Next message: [Python-Dev] Complexity documentation request
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

> Dict access should probably be documented as no worse
> than O(log n) to allow for tree implementations.

That should not be documented. The current dict implementation
may use O(n) for lookup operations, where n is the number of
keys in the dictionary, and counting comparison operations.

Regards,
Martin

• Previous message: [Python-Dev] Complexity documentation request
• Next message: [Python-Dev] Complexity documentation request
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4