二分查找 递归与非递归的实现

 int binarysearch(int array[],int low ,int high,int target){ //递归来实现

    if (low> high || array==NULL){
        return -1;
    }
    int middle = (low + high) /2;
    if (array[middle] == target){
        return  middle;
    }
    else if (array[middle]> target){
        binarysearch (array, 0, middle-1);
    }
    else{
        binarysearch (array,  middle+1,high);
    }
    
}

int binarysearch(int array[],int n; int target) {
    // 非递归实现
    while{low<high}{
         int middle  = (low + high)/2;
         if (array[middle] ==target){
             return middle;
         } else if (array[middle]>target){
             high = middle;
         }
         else if (array[middle]<target){
             low = middle +1;
         }
         else {
             return -1;
         }



    }

}