折半查找实现1

/* binarySearch  
05/05/13 17:24
*/
#include<iostream>
#include<cstdlib>
using namespace std;
int binarySearch(int *array,int low,int high,int value)// 返回value的位置，如果是-1则表示没找到 
{
    if(low<=high){
        int mid;
        mid= (low+high)/2;
        if(value==array[mid])
            return mid;
        else if(value<array[mid])
            high=mid-1;
        else
            low=mid+1;
        return binarySearch(array,low,high,value); 
    }
    else return -1;
} 
int main(){
    int num;
    int value;
    while(1){    
        cout<<"input the number of array:"<<endl;
        cin>>num;
        int *array=NULL;
        array = (int *)malloc(sizeof(int)*(num));
        cout<<"input the sorted array:"<<endl;
        for(int i=0;i<num;i++)    cin>>array[i];
        cout<<"input search value:"<<endl;
        cin>>value;
        cout<<value<<"'s postion is:"<<binarySearch(array,0,num-1,value)<<endl;    
    }
    return 0;
}