在找到第一个> =元素的索引时

Question

Given an ordered list A of integers, and an integer q <= A[-1] , I want to find the smallest non-negative index i such that A[i] >= q .

I can think of ways to do this efficiently (eg with some form of binary search), but I'd like to know if there's anything in either Python's standard library or in numpy/scipy that I can use to implement this.

(For example, something analogous to MATLAB's interp1 function.)

Answer 1

Python provides a module for performing binary search operations on a sorted list: bisect . I believe the function you want is bisect_left .