Welcome to the Treehouse Community

Want to collaborate on code errors? Have bugs you need feedback on? Looking for an extra set of eyes on your latest project? Get support with fellow developers, designers, and programmers of all backgrounds and skill levels here with the Treehouse Community!

Looking to learn something new?

Treehouse offers a seven day free trial for new students. Get access to thousands of hours of content and join thousands of Treehouse students and alumni in the community today.

Start your free trial


How does python handles the re-ordering of the index when elements are added in the middle or in the beginning of list?

Imagine there are 10k items in list and I am inserting an item in the middle of the list. How does Python handles this operation to re-arrange the order?

I was wondering if such an operation in Python makes it very slow?

2 Answers

Chris Freeman
Chris Freeman
Treehouse Moderator 68,404 Points

As can be seen in list time complexity table, insertion into a list is O(n) meaning the insertion time linearly increases as the length of a list increases.