The bisect module implements an algorithm for inserting elements into
a list while maintaining the list in sorted order. This can be much more
efficient than repeatedly sorting a list, or explicitly sorting a large
list after it is constructed.
Python, OpenStack, and Open Source
The bisect module implements an algorithm for inserting elements into
a list while maintaining the list in sorted order. This can be much more
efficient than repeatedly sorting a list, or explicitly sorting a large
list after it is constructed.