Internal working of list in Python
Introduction to Python lists :
Python lists are internally represented as arrays. The idea used is similar to implementation of vectors in C++ or ArrayList in Java. The costly operations are inserting and deleting items near the beginning (as everything has to be moved). Insert at the end also becomes costly if preallocated space becomes full.
We can create a list in python as shown below.
We can access each element of a list in python by their assigned index. In python starting index of list sequence is 0 and ending index is (if N elements are there) N-1.
Also as shown in above array lists also have negative index starting from -N (if N elements in the list) till -1.
Viewing the elements of List in Python :
Individual items of a list can be accessed through their indexes as done in below code segment.
Assigning and Accessing data:
For creating a list we need to specify the elements inside square brackets ‘’ and then give it a name. Whenever you want to access the list elements then use this list name and index of element you want to show.
Each element in list is assigned an index in positive indexing we have index from 0 to end of the list and in negative indexing we have index from -N(if elemts are N) till -1.
As shown in above examples the work of accessing elements is manual. We can also access or assign elements through loops.
We can update already assigned elements to the list and also can append one element at a time to your list.Even you can extend your list by adding another list to current list.
The above task can be performed as follows.
Note: append() and extend() are built in methods in python for lists.
Deleting elements of list :
We can delete elements in lists by making use of del function. In this you need to specify the position of element that is the index of the element and that element will be deleted from the list and index will be updated.
In above shown image the element 3 in index 2 has been deleted and after that index has been updated.
Time Complexities of Operations
Amortized Worst Case
|Sort||O(n log n)||O(n log n)|
|x in s||O(n)||O(n)|
Source : Python Wiki
Attention geek! Strengthen your foundations with the Python Programming Foundation Course and learn the basics.
To begin with, your interview preparations Enhance your Data Structures concepts with the Python DS Course. And to begin with your Machine Learning Journey, join the Machine Learning – Basic Level Course