#define _CRT_SECURE_NO_DEPRECATE
#include<stdio.h >
//在有序数组中寻找数字
int main()
{
int arr[] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
int k = 7;//找七
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)
{
right = mid;
}
else if (arr[mid] < k)
{
left = mid;
}
else
{
printf("k has been found,the subscript is:%d\n", mid);
break;
}
}
if (left>right)
printf("k is not here.\n");
return 0;
}
在有序数组中寻找数字
最新推荐文章于 2023-04-19 21:57:54 发布