1、Binary search is an efficient algorithm for finding an element's position in a sorted array.
二分查找是一种在已排序数组中寻找元素位置的高效算法。

2、The bisearch function returns the index of the first element in the sorted list that is greater than or equal to the target.
bisearch 函数返回排序列表中第一个大于或等于目标值的元素的索引。