How to find runtime complexity of funtions that use list in Python

Question

Suppose I have a function that uses a list. Now how to calculate run time complexity of such functions?

Answer 1

The Average Case assumes parameters generated uniformly at random.

Internally, a list is represented as an array; the largest costs come from growing beyond the current allocation size (because everything must move), or from inserting or deleting somewhere near the beginning (because everything after that must move). If you need to add/remove at both ends, consider using a collections.deque instead.