About 42,600 results
Open links in new tab
  1. bisect — Array bisection algorithm — Python 3.14.2 documentation

    3 days ago · The module is called bisect because it uses a basic bisection algorithm to do its work. Unlike other bisection tools that search for a specific value, the functions in this module are designed …

  2. Python bisect Module - W3Schools

    The bisect module helps maintain a list in sorted order without having to sort after each insertion. Use it for binary search and order-preserving insertions with functions like bisect and insort.

  3. Bisect Algorithm Functions in Python - GeeksforGeeks

    Aug 1, 2025 · The bisect module in Python provides simple and fast (binary search based) functions to search an element in a sorted list, find the correct position to insert new elements, and insert new …

  4. Everything You Can Do with Python's bisect Module

    Nov 8, 2023 · While Python's bisect module is very simple - containing really just 2 functions - there's a lot one can do with it, including searching data efficiently, keeping any data sorted, and much more - …

  5. Efficient Python Bisect for Sorted List Operations (2025 Guide)

    What is Python’s bisect Module? The bisect module is Python's highly optimized implementation of the binary search algorithm for sorted sequences. Its core purpose is to find the correct insertion point for …

  6. bisect — Array bisection algorithm — Python documentation

    The module is called bisect because it uses a basic bisection algorithm to do its work. The source code may be most useful as a working example of the algorithm (the boundary conditions are already right!).

  7. Python Fundamentals: bisect - DEV Community

    Jul 7, 2025 · What is "bisect" in Python? bisect (specifically, the bisect module in the Python standard library) implements a binary search algorithm. While often associated with sorted lists, its core utility …

  8. Python bisect: Tutorial to the Array Bisection Algorithm

    Mar 13, 2025 · The bisect module in Python provides tools for maintaining a sorted list without needing to reorder it after each insertion. This is especially useful when handling long lists with expensive …

  9. Python - bisect Usage - Dot Net Perls

    Mar 22, 2024 · With the bisect module, we have useful methods for binary search—we can call bisect to find insertion points for an element to keep a list sorted as we go along.

  10. Binary Search (bisect) in Python - GeeksforGeeks

    Jul 11, 2025 · In this article, we will looking at library functions to do Binary Search. Finding first occurrence of an element. bisect.bisect_left (a, x, lo=0, hi=len (a)) : Returns leftmost insertion point …