To-Check list The mechanism of list. Time complexity of serveral operations for list in Python The implementation when a list object is redefined as set.

Summary All of the Objects used in Python are defined as PyObject extension. We can treat List in Python basically the same as C lang’s. Access to an element in a List in Python takes O(1) time complexity, which is the same as C lang’s random access to an array. Access to elements in a List using slice in Python takes O(k) time complexity (k means the slice’s length) because it is implemented as new memory allocation and copy elements using for loop.