In this shot, we’ll learn about the
insort_left() method in Python.
We may want to insert an element in a sorted list, but we still want to maintain the sort order after insertion. If we do this operation over a long list, this will become a costly operation. We can use the
bisect module in this situation, which ensures that the list is automatically put in sorted order.
insort_left() method is provided by the
bisect module, which sorts the list in-place after inserting the given element. If the element is already present, it inserts it at the left-most position.
import bisect bisect.insort_left(list, element)
list: This contains a list of sorted integers.
element: This provides an element that needs to be inserted into the sorted list.
Let’s look at an example to understand this better.
#import the module import bisect #given sorted list of numbers nums = [1,3,5,7,10,25,49,55] #given element to be inserted into the list ele = 50 #insert the element bisect.insort_left(nums, ele) #print the nums after inserting the element print(nums)
In the code snippet above:
bisectmodule, which contains methods like
insort_right, and so on.
numsin sorted order.
eleto be inserted in the list
elementas parameters to the
insort_left()method, which sorts the list in place after inserting the given element.
View all Courses