# Bisect Algorithm Functions:

The bisect algorithm finds a position in list where an element has to be inserted to keep the list sorted.

The bisect algorithm is provided in the bisect module. It is an essential function as it reduces the overhead time required to sort the list continuously after the insertion of each element.

Important Bisection Functions:

1.bisect(list, num, beg, end): It is a function that returns the position in the sorted list. In this, the number passed in argument can be placed to maintain the resultant list in sorted order. In case the element is present in the list, the right most position where element needs to be inserted is returned. This is a function that takes four arguments, the list which has to be worked on, the number which has to be inserted, starting position of list and ending position.

1. bisect_left(list, num, beg, end): It is a function that returns the position in the sorted list. The number passed in argument can be placed to maintain the resultant list in sorted order. In case the element is already present in list, the left most position where element needs to be inserted is returned. This is a function that takes four arguments, the list which has to be worked on, the number which has to be inserted, starting position of list and ending position.
2. bisect_right(list, num, beg, end): It is a function that works similar to bisect(). 3. insort(list, num, beg, end): It is a function that returns the sorted list after the insertion of number in appropriate position. In case the element is already present in list, the insertion of element is done at the rightmost possible position. This is a function that takes four arguments, the list which has to be worked on, the number which has to be inserted, starting position of list and ending position.
4. insort_left(list, num, beg, end): It is a function that returns the sorted list after the insertion of number in appropriate position. In case the element is already present in list, the insertion of element is done at the leftmost possible position. This is a function that takes four arguments, the list which has to be worked on, the number which has to be inserted, starting position of list and ending position.
5. insort_right(list, num, beg, end): It is a function similar to insort() function.  