In this article,'n' represents the number of elements in the container,'k' represents the element value or the number of parameters, and'i' represents the index value.
List
| operating | time complexity |
|---|---|
| copy | O (n) |
| append | O (1) |
| insert | O (n) |
| extend | O(k) |
| index | O (1) |
| Assignment (modify value) | O (1) |
| pop() | O (1) |
| pop(i) | O (n) |
| remove(k) | O (n) |
| Traverse | O (n) |
| slice | O(k) |
| Sort | O(n log n) |
| in | O (n) |
| max()、min() | O (n) |
| len () | O (1) |
Two-way queue (collections.deque)
| operating | time complexity |
|---|---|
| copy | O (n) |
| append | O (1) |
| appendleft | O (1) |
| extend | O(k) |
| extendleft | O(k) |
| pop | O (1) |
| popleft | O (1) |
| rotate | O(k) |
| remove | O (n) |
Set
| operating | time complexity |
|---|---|
| in | O (n) |
| add | O (1) |
| pop() | O (1) |
| pop(i) | O (n) |
| remove(k) | O (n) |
| Traverse | O (n) |
| Union (s, t) | O (len (s) + len (t)) |
| Intersection s&t | O (len (s) * len (t)) |
| Difference st | O (len (s)) |
| s.difference_update(t) | O (len (t)) |
| Symmetric difference set s^t | O (len (s) * len (t)) |
| s.symmetric_difference_update(t) | O (len (t) * len (s)) |
Dictionary (dict)
| operating | time complexity |
|---|---|
| copy | O (n) |
| Traverse | O (n) |
| index | O (1) |
| delete | O (1) |
| Change element | O (1) |
| in | O (1) |