首先 随机创建一个数组 然后对数组进行排序 后在进行二分查找

#define  _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<time.h>
void paixu(int a[],int n)
{
for (int i = 0; i < n-1; i++)
{
for (int j = 0; j < n - i-1; j++)
{
//小到大
if (a[j] > a[j + 1])
{
int temp = a[j + 1];
a[j + 1] = a[j]; 
a[j] = temp;
}
}
}  

}

int reserch2(int a[],int n,int num)
{
int start = 0;
int end = n - 1;
//int middle = (start + end) / 2;
while (start < end)
{
int middle = (start + end) / 2;
//printf("\n开始查找%d,%d,%d", tou, wei, zhong);
if (num>a[middle])
{
start = middle + 1;
int middle = (start + end) / 2;
}
else if (a[middle] >num)
{
end = middle - 1;
int middle = (start + end) / 2;
}
else
{
return middle;
}
/*if (a[middle] == num)
{
return middle;
}
else   if (a[middle] > num)
{
end = middle - 1;
middle = (start + end) / 2;
}
else
{
start = middle + 1;
middle = (start + end) / 2;
}*/


}
return -1;
}
int rrsearch(int a[],int n,int num)
{

//for (int i=0;i<60;i++)
for (int start = 0, end =n-1, middle=(n-1)/2; start<=end;middle=(start+end)/2)
{
if (num>a[middle])
{
start = middle + 1;
}
else if (a[middle] > num)
{
end = middle - 1;
}
else
{
return middle;
}
}
return -1;
}
void main41()
{
//产生一个随机数
int a[64];
time_t tms;
srand((unsigned int)time(&tms));
for (int i = 0; i < 64; i++)
{
a[i] = rand() % 100+100;
}
paixu(a, 64);
for (int i = 0; i < 64; i++) //循环打印数据
{
printf("\n%d", a[i]);
}
int num;
scanf("%d",&num);
//int x = reserch2(a, 64,num );
int x = rrsearch(a, 64, num);
if(x == -1)
{
printf("没有找到哦啊");
}
else
{
printf("找到%d", a[x]);
}



system("pause");
}