具体要求:编写int binsearch(int x, int v], int n); 功能:在v[0]<= v[1] <= v[2] <= ... <= v[n - 1]的数组中查找x
具体方法:折半查找法(二分查找法)
int main()
{
int arr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
int k = 7;//要查找的数字
//在arr这个有序数组中查找k
int sz = sizeof(arr) / sizeof(arr[0]); //数组的元素个数=整个数组大小/一个数组的大小
int left = 0; //左下标
int right = sz -1; //右边元素的下标
while (left <= right)
{
int mid = (left + right) / 2;
if (arr[mid] < k)
{
left = mid + 1;
}
else if ( arr[mid] > k)
{
right = mid - 1;
}
else
{
printf("找到了,下标是:%d\n", mid);
break;
}
}
if (left > right)
{
printf("找不到了\n");
}
return 0;
}