首先,数组是有序的,在进行二分搜索。每次与中间的元素对比,如果是目标元素则输出,否则 low = mid+1(high = mid -1);
然后继续这样直到找到目标元素
C语言代码如下
# include <stdio.h>
int A[100];
int binarysearch(int A[],int n,int x)
{
int low = 1;
int high = n;
int j = 0;
while(low <= high && j == 0)
{
int mid = (high+low)/2;
//int m = A[mid];
if(x == A[mid])
j = mid;
else if (x < A[mid])
high = mid - 1;
else low = mid + 1;
}
return j;
}
int main()
{
int x;
int n;
printf("请输入元素的个数:\n");
scanf("%d",&n);
printf("请输入%d个数字:\n",n);
for(int i= 0;i<n;i++)
scanf("%d",&A[i]);
printf("请输入要查找的元素:\n");
scanf("%d",&x);
int j = binarysearch(A,n,x);
printf("查找元素的位置是:%d",j);
return 0;
}
算法的时间复杂度为 int(log n) + 1.(已排好序,算法中不需要排序)