定义一个有序数组,在数组中查找数字n
int binsearch(int n, int* arr, int sz)
{
for (int i = 0; i < sz; i++)
{
if ( *(arr+i) == n )
{
return i;
}
}
return -1;
}
int main()
{
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int sz = sizeof(arr) / sizeof(arr[0]);
printf("请输入你要查找的数值:\n");
int n = 0;
scanf("%d", &n);
int pos = binsearch(n, arr,sz);
if (pos != -1)
printf("你要找的数字的下标是%d\n", pos);
else
printf("找不到\n");
return 0;
}