代码:
#include <iostream>
using namespace std;
//@return 返回有序序列中第一个大于等于query的下标,若无返回-1
int binarySearchBAE(int * seq, int n, int query){
int low = 0; int high = n - 1;
while (low <= high){
int mid = low + ((high - low) >> 1);
if (seq[mid] >= query)
high = mid - 1;