June 2020
Intermediate to advanced
382 pages
11h 39m
English
Content preview from 40 Algorithms Every Programmer Should Know
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
Start your free trial
The time complexity of tuples
The time complexity of various functions of tuples can be summarized as follows (using Big O notation):
| Function | Time Complexity |
| Append | O(1) |
Note that Append is a function that adds an element toward the end of the already existing tuple. Its complexity is O(1).