list - Python computational complexity of array insert vs +

Question

I know that list insert operation is O(n). For example, arr = [2,3,4,5] and arr.insert(0,1) yields arr = [1,2,3,4,5] after doing 4 operations shifting each of 4 elements to the right in order to insert value 1 at 0 index.

We can do the same thing with + operator. arr = [1] + arr is this identical in terms of computational complexity? is the same thing going on in the backend?

question from:https://stackoverflow.com/questions/65854921/python-computational-complexity-of-array-insert-vs

Answer 1

Waitting for answers