学习笔记：二分法查找的递归和非递归两种算法

首先是非递归查找函数：

int BinarySearch(PTABLE table,int numb){
    int Left,Right,Mid,ERROR=-1;
    Left=0;
    right=table->Lenth-1;
    while(right>=Left){
        mid=(Right+Left)/2;
        if(table->data[mid]>numb)
            Right=mid-1;
        else if(table->data[mid]<numb)
            Left=mid-1;
        else
            return(table->data[mid]);
    }
    return(ERROR);
}

采用递归方式：

//recurbinary
int recurbinary(PTABLE table,int Left,int Right,int numb){
    if(Left>Right)
        return(-1);
    mid=(Left+Right)/2;
    if(mid==table->data[mid])
        return(table->data[mid]);
    else if(mid>table->data[mid])
        recurbinary(table,Left,mid-1,numb);
    else if(mid<table->data[mid])
        recurbinary(table,mid+1,Right,numb);
}