Time complexity of operations on built-in types
Summary
The article documents the time complexity of common operations on Python's built-in types in CPython, using Big-O notation and noting amortized costs and implementation caveats. It provides tables listing costs for list, tuple, dict, set, str, memoryview, and range operations, with notes on when costs may degrade. This makes it a valuable reference for performance-conscious software design and optimization.