Bisect usage in Python

This article mainly introduces the usage of bisect in Python, mainly describes the insert and sort operations for arrays, which is of great practical value, for more information about how to use bisect in Python, see the following example. Share it with you for your reference. The specific analysis is as follows:

In general, bisect in Python is used to operate the sorting array. for example, you can insert data into an array and sort it. The following code demonstrates how to operate:

import bisectimport randomrandom.seed(1)print('New pos contents')print('-----------------')l=[] for i in range(1,15):  r=random.randint(1,100)  position=bisect.bisect(l,r)  bisect.insort(l,r)  print '%3d %3d'%(r,position),l

Output result:

New pos contents----------------- 14  0 [14] 85  1 [14, 85] 77  1 [14, 77, 85] 26  1 [14, 26, 77, 85] 50  2 [14, 26, 50, 77, 85] 45  2 [14, 26, 45, 50, 77, 85] 66  4 [14, 26, 45, 50, 66, 77, 85] 79  6 [14, 26, 45, 50, 66, 77, 79, 85] 10  0 [10, 14, 26, 45, 50, 66, 77, 79, 85] 3  0 [3, 10, 14, 26, 45, 50, 66, 77, 79, 85] 84  9 [3, 10, 14, 26, 45, 50, 66, 77, 79, 84, 85] 44  4 [3, 10, 14, 26, 44, 45, 50, 66, 77, 79, 84, 85] 77  9 [3, 10, 14, 26, 44, 45, 50, 66, 77, 77, 79, 84, 85] 1  0 [1, 3, 10, 14, 26, 44, 45, 50, 66, 77, 77, 79, 84, 85]

We can see that the array is sorted at the same time when these random numbers are inserted. However, there are some repeated elements, such as the above 77 and 77. You can set the sequence of these repeated elements. if you want the repeated elements to appear on the left of the same element, you can use bisect_left. Otherwise, you can use bisect_right, and use insort_left and insort_right accordingly. For example, the following code shows repeated element index changes:

import bisectimport randomrandom.seed(1)print('New pos contents')print('-----------------')l=[] for i in range(1,15):  r=random.randint(1,100)  position=bisect.bisect_left(l,r)  bisect.insort_left(l,r)  print '%3d %3d'%(r,position),l

Output result:

New pos contents----------------- 14  0 [14] 85  1 [14, 85] 77  1 [14, 77, 85] 26  1 [14, 26, 77, 85] 50  2 [14, 26, 50, 77, 85] 45  2 [14, 26, 45, 50, 77, 85] 66  4 [14, 26, 45, 50, 66, 77, 85] 79  6 [14, 26, 45, 50, 66, 77, 79, 85] 10  0 [10, 14, 26, 45, 50, 66, 77, 79, 85] 3  0 [3, 10, 14, 26, 45, 50, 66, 77, 79, 85] 84  9 [3, 10, 14, 26, 45, 50, 66, 77, 79, 84, 85] 44  4 [3, 10, 14, 26, 44, 45, 50, 66, 77, 79, 84, 85] 77  8 [3, 10, 14, 26, 44, 45, 50, 66, 77, 77, 79, 84, 85] 1  0 [1, 3, 10, 14, 26, 44, 45, 50, 66, 77, 77, 79, 84, 85]

This function is bisect. bisect (list, key), which is like the tailMap (fromkey) of TreeMap in java ).

I hope this article will help you with Python programming.