按大小顺序存储的折半查找

int Search(int *aValue, int key, int low, int high)
{

    while (low <= high)
    {   
        int mid = (low + high)/2;
       
        if (key == aValue[mid])
            return mid;
        else if (key < aValue[mid])
            high = mid - 1;
        else
            low = mid + 1;
    }

    return -1;
}
void main(int argc, char **argv)
{
    int aValue[10] = {3, 10, 14, 18, 20, 24, 37, 58, 69, 80};

    printf("find at %d/n", Search(aValue, 18, 0, 9));
}