数组传参时,本质上是传的是首元数的地址,相当于指针变量。
//写一个函数查找整数顺序数组中的数(二分查找)
#include <stdio.h>
int search(int arr[], int sz, int h)
{
int left = 0;
int right = sz - 1;
while (left<=right)
{
int mid = left + (right - left) / 2;
if (arr[mid] > h)
{
right = mid - 1;
}
else if (arr[mid] < h)
{
left = mid + 1;
}
else if (arr[mid] = h)
{
return mid;
}
}
return -1;
}
int main()
{
//输入整数顺序数组
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int h = 7;
int sz = sizeof(arr) / sizeof(arr[0]);
//构造查找函数
int ret = search(arr, sz, h);
//打印
if (ret == -1)
{
printf("找不到");
}
else
{
printf("下标是:%d", ret);
}
return 0;
}