- 二分查找(折半查找)
#include<stdio.h>
#include<stdlib.h>
#define MAXSIZE 10010
int RecurSearch(int A[],int low,int high,int key){
int flag=0;
while(low<=high){
int mid=(low+high)/2;
if(A[mid]==key){
printf("元素下标为:%d,查找成功!\n",mid);
flag=1;
break;
}
if(key>A[mid])
low=mid+1;
else if(key<A[mid])
high=mid-1;
}
if(!flag)
printf("查找失败!\n");
}
void display(int A[],