#include "stdio.h"
int BinarySearch(int a[],int x,int n){
int left=0;
int right = n-1;
while(left<=right){
int middle = (left+right)/2;
if(x==a[middle]) return middle;
if(x > a[middle]) left=middle+1;
else right=middle-1;
}
return-1;
}
main(){
int a[]={0,1,2,3,4,5,6,7,8,9};
int find=5;
printf("%d",BinarySearch(a,find,10));
}
C实现二分搜索
最新推荐文章于 2024-05-23 06:14:37 发布