#include<stdio.h>
int BinarySearch(int A[], int N, int K) {
int high, low, mid;
low = 0; high = N - 1;
while (low <= high) {
mid = (low + high) / 2;
if (K < A[mid])
high = mid - 1;
else if (K > A[mid])
low = mid + 1;
else
return mid; // found
}
return -1; // not found
}
int main(){
int A[3]={1,2,3};
int k;
scanf("%d",&k);
int j=BinarySearch(A,3,k);
printf("%d",j);
return 0;
}
1、编写程序,在程序中初始化一个有序整数数组;从键盘输入一个整数,在该数组中用折半查找,输出查找结果(下标)。
最新推荐文章于 2022-11-20 22:59:45 发布