Insert binary search and ordered list in python: application of the bisect module, pythonbisect

Insert binary search and ordered list in python: application of the bisect module, pythonbisect

The python built-in module bisect implements binary search and inserts an ordered list. bisect can find out where the new element should be inserted to maintain the order of the original list, while bisect. insort indeed inserts the new element into that position. See the following demo:

As you can see, when the element to be inserted is the same as the element in the list, it is inserted to the next subscript of all original elements. Here we should note that: the functions of the bisect module do not determine whether the original list is ordered, because in this case, too many system resources are occupied. Therefore, even if they are used in unordered lists, no error is reported, but it may lead to incorrect results.