代码

int binary_search(const unsigned *a, int n, unsigned x)
{

        int l = 0, r = n - 1;
        while(l < r) {
             int mid = l + r >> 1;
if(a[mid] >= x) r = mid;
else l = mid + 1; 
        }
return l;
	return 233;
}

评测结果