if __name__ == "__main__" in python explained | Advanced python

[Hindi] *args and **kwargs in python explained | Advanced python tutorials in Hindi

Try, Except, Else and Finally in python explained | Advanced python tutorials

Virtual Environment (venv) in python explained | Advanced python tutorials

Iterators, Iterables and Generators in python explained | Advanced python tutorials

List Comprehension, Dictionary Comprehension And Generator Comprehension

Map, Filter and Reduce in Python |  Advanced Python

Lambda functions in python explained | Advanced python

Advanced List Slicing In Python Explained | Advanced python tutorials

Bisect Module In Python Explained | Advanced python tutorials

Enumerate Function In Python Explained | Advanced python tutorials

Format Function In Python Explained | Advanced python tutorials

Join Function In Python Explained | Advanced python tutorials

<h4>Introduction:</h4>
In this blog we will talk about a module named bisect. We will talk about some functions of it and how is it helpful for us?
<h4>Bisect Module:</h4>
It is an in-built module. You can simply import it by writing:
<pre class="language-python"><code>import bisect</code></pre>
This module is helpful when we want to know where should we insert our value in a list. This is how it works:
<pre class="language-python"><code>import bisect

lis = [1,2,5,10,15,17,28,35,59,61]
print(bisect.bisect(lis, 55))

Output:
8</code></pre>
Start count from zero and yes it should be at 8th place(right now 59 is on 8th place). It also works on alphabets. Eg:
<pre class="language-python"><code>import bisect

lis1 = ["a","e", "h", "m", "o", "s"]
print(bisect.bisect(lis1, "k"))

Output:
3</code></pre>
&lt;|AD|&gt;
k should be between h and m and if we start count from zero then according to this module it should be on m's place which is correct. Earlier m's index was be 3 now it's 4 because k's index is 3.
If this is confusing then this module offers one more function called "insort()" which will make things easy for you. Here is how it works:
<pre class="language-python"><code>import bisect

lis = [1,2,5,10,15,17,28,35,59,61]
print(bisect.bisect(lis, 55))
bisect.insort(lis, 55)
print(lis)

Output:
8
[1, 2, 5, 10, 15, 17, 28, 35, 55, 59, 61]</code></pre>
See, insort() function itself added 55 in the list. Similarly,
<pre class="language-python"><code>import bisect

lis1 = ["a","e", "h", "m", "o", "s"]
print(bisect.bisect(lis1, "k"))
bisect.insort(lis1, "k")
print(lis1)

Output:
3
['a', 'e', 'h', 'k', 'm', 'o', 's']</code></pre>
It added k in the list.
In this way we can use this module.
Note:&nbsp;It does tell you where to place the value but your list should be sorted. If your list has randomly things placed in it then module may lead to wrong conclusion. Also it doesn't give you any warning that your list is not sorted.