40 Algorithms Every Programmer Should Know
上QQ阅读APP看书,第一时间看更新

The time complexity of tuples

The time complexity of various functions of tuples can be summarized as follows (using Big O notation):

Note that Append is a function that adds an element toward the end of the already existing tuple. Its complexity is O(1).