?

int binSearch(int arr[], int low, int high, int key);
int binSearch2(int arr[], int low, int high, int key);
int binSearch3(int arr[],int start,int ends,int key);
int main() {
??? int arr[]={3,8,11,15,17,22,23,26,28,29,34};
??? //printf("%d",binSearch(arr,0,10,26));
??? printf("%d",binSearch3(arr,0,10,26));
??? return 1;
}

int binSearch(int arr[], int low, int high, int key) {
??? int flag=-1;
??? int mid = (low + high) / 2;
??? if (low > high) {
??????? flag= -1;
??? } else {

??????? if (arr[mid] ??????????? flag= binSearch(arr, mid + 1, high, key);
??????? } else if (arr[mid]>key) {
??????????? //比如要找的節(jié)點(diǎn)在下面這一層?? 那么這一層會返回下標(biāo)上來 用flag接住嘛...
??????????? flag= binSearch(arr,low,mid-1,key);//又差一點(diǎn)忘記了用flag取接住返回值了

??????? } else {
??????????? flag= mid;
??????? }
??? }
??? return flag;
}

//ok==============================
int binSearch2(int arr[], int low, int high, int key) {
??? int mid = (low + high) / 2;
??? if (low > high) {
??????? return -1;
??? } else {

??????? if (arr[mid] ??????????? return binSearch2(arr, mid + 1, high, key);
??????? } else if (arr[mid]>key) {
??????????? return binSearch2(arr,low,mid-1,key);
??????? } else {
??????????? return mid;
??????? }
??? }

}

int binSearch3(int arr[],int start,int ends,int key){
??? int mid=-1;
??? while(start??????? mid=(start+ends)/2;
??????? if(arr[mid]??????????? start=mid+1;
??????? }else if(arr[mid]>key){
??????????? ends=mid-1;
??????? }else{
??????????? break;
??????? }
??? }//上述循環(huán)結(jié)束后不一定就是 start>ends的? 因為有break語句
??? if(start>ends){
??????? mid=-1;
??? }
??? return mid;
}???????