Time complexity of accessing an element in a tuple

Question

There is similar question about hash (dictionaries) and lists, also there is a good piece of info here: http://wiki.python.org/moin/TimeComplexity

But I didn't find anything about tuples.

The access time for

data_structure[i]

• for a linked list is in general O(n)
• for dictionary is ~ O(1)

What about tuple? Is it O(n) like for a linked list or O(1) like for an array?

Answer 1

It's O(1) for both list and tuple. They are both morally equivalent to an integer indexed array.