题目:
在一个有序数组中查找具体的某个数字n。编写int binsearch(int x, int v[], int n);功能:在v[0]<=v[1]<=v[2]<=…<=v[n-1]的数组中查找x
例子:在1到10的整数中查找数字7,并输出7的下标。(注意是有序数组)
{1,2,3,4,5,6,7,8,9,10}
0 1 2 3 4 5 6 7 8 9
找到7
方法1(遍历):
#include<stdio.h>
int main()
{
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int left = 0,right = 9;
int k = 7,i = 0;
int sz = sizeof(arr) / sizeof(arr[0]);//元素个数
for (i = 0; i < sz; i++)
{
if (k == arr[i])
{
printf("找到了,下标是%d", i);
break;
}
}
if (i == sz)
printf("找不到\n");
return 0;
}
方法2(折半查找法 或者叫 二分查找法):
更快速更方便
#include<stdio.h>
int main()
{
int i = 0, left = 0, right = 9;
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
int k = 7;
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;
}