1.左闭右闭
int BinarySearch(int* a, int n, int x)
{
int begin = 0;
int end = n -1 ;
while (begin <= end)
{
int mid = begin + ((end - begin) >> 1);
if (a[mid] > x)
end = mid
1.左闭右闭
int BinarySearch(int* a, int n, int x)
{
int begin = 0;
int end = n -1 ;
while (begin <= end)
{
int mid = begin + ((end - begin) >> 1);
if (a[mid] > x)
end = mid