Where can I find the time and space complexity of the built-in sequence types in Python

Question

I've been unable to find a source for this information, short of looking through the Python source code myself to determine how the objects work. Does anyone know where I could find this online?

Answer 1

If your asking what I think your asking, you can find them Here. Page 476 and on.

It's written around optimization techniques for python, It's mostly Big-O notation of time efficiencies not much memory.

Hope it still helps.

Brian Gianforcaro

Answer 2

Raymond D. Hettinger does an excellent talk about Python's built-in collections called 'Core Python Containers - Under the Hood'. The version I saw focussed mainly on set and dict, but list was covered too.

I haven't found a video of the talk online yet, but there are some photos of the pertinent slides from EuroPython in a blog.

Here is a summary of my notes on list:

• Stores items as an array of pointers. Subscript costs O(1) time. Append costs amortized O(1) time. Insert costs O(n) time.
• Tries to avoid memcpy when growing by over-allocating. Many small lists will waste a lot of space, but large lists never waste more than about 12.5% to overallocation.
• Some operations pre-size. Examples given were range(n), map(), list(), [None] * n, and slicing.
• When shrinking, the array is realloced only when it is wasting 50% of space. pop is cheap.

Answer 3

Checkout the TimeComplexity page on the py dot org wiki. It covers set/dicts/lists/etc at least as far as time complexity goes.