https://ryanorban.com/categories/binary-search/Recent content in Binary-Search on Ryan OrbanHugoen-usme@ryanorban.com (Ryan Orban)me@ryanorban.com (Ryan Orban)Ryan OrbanSun, 22 Nov 2020 00:00:00 +0000https://ryanorban.com/notes/python-bisect-module/Sun, 22 Nov 2020 00:00:00 +0000me@ryanorban.com (Ryan Orban)https://ryanorban.com/notes/python-bisect-module/<h3 id="summary" class="scroll-mt-8 group"> Summary <a href="#summary" class="no-underline hidden opacity-50 hover:opacity-100 !text-inherit group-hover:inline-block" aria-hidden="true" title="Link to this heading" tabindex="-1"> <svg xmlns="http://www.w3.org/2000/svg" width="16" height="16" fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" class="lucide lucide-link w-4 h-4 block" viewBox="0 0 24 24" > <path d="M10 13a5 5 0 0 0 7.54.54l3-3a5 5 0 0 0-7.07-7.07l-1.72 1.71" /> <path d="M14 11a5 5 0 0 0-7.54-.54l-3 3a5 5 0 0 0 7.07 7.07l1.71-1.71" /> </svg> </a> </h3> <p>Python&rsquo;s <code>bisect</code> standard library module implements binary search for maintaining and querying sorted lists. This blog post by John Lekberg covers two practical use cases that illustrate when the module is the right tool: statistical data binning and maintaining sorted lists for order statistics.</p>