Time complexity for a sublist in Python

Question

In Python, what is the time complexity when we create a sublist from an existing list?

For example, here data is the name of our existing list and list1 is our sublist created by slicing data.

data = [1,2,3,4,5,6..100,...1000....,10^6] 
list1 = data[101:10^6]

What is the running time for creating list1?

Is it O(10^6) i.e.O(N), or O(1)?

levi · Accepted Answer · 2016-09-05 22:57:43Z

9

Getting a list slice in python is O(M - N) / O(10^6 - 101)

Here you can check python list operations time complexity

By underneath, python lists are represented like arrays. So, you can iterate starting on some index(N) and stopping in another one(M)

answered Sep 5, 2016 at 22:51

levi

22.8k7 gold badges79 silver badges76 bronze badges

Sign up to request clarification or add additional context in comments.

1 Answer 1