递归与分治策略（1）--二分搜索

代码

Template <class Type>
int sort(Type list[],int n, Type &a)
{
    int low = 0;
    int high = n -1;
    while(low <= high)
    {
        int middle = (low + high)/2;
        if(list[middle]==a)
            return middle;
        else if(list[middle]>a)
            high = middle-1;
        else
            low = middle+1;  
    }
    return -1;
}