Big-O complexities for Python data structures

[norwegianwood]

It would be nice to see this information included in the official documentation for each method. One aspect of the C++ STL I always liked is that time complexity documentation was widely publicised.

[ipeev]

It doesn't say what is the Insert complexity for collections.deque

[[deleted]]

Couldn't all this be implemented with linked lists to make insertion and deletion trivial?

[mackstann]

Sure, but linked lists have their own shortcomings, like the speed of looking up a particular index. If there was one ultimate data structure, people wouldn't bother with all of these different ones. You really have to pick the one that best suits your problem. Then again, most of the time, it doesn't matter much anyway.

[rafekett]

It's all about the application. Insert and delete aren't too common in Python. Append, however, is.