//函数查找

template <class T> int seqSearch(const T list[], int n, const T &key)

{

    for (int i = ; i < n; i++)

    {

        if (list[i] == key)

            return i;

    }

    return -;

}

//折半查找法

template <class T> int binSearch(const T list[], int n, const T &key)

{

    int low = ;

    int high = n - ;

    while (low <= high)

    {

        int mid = (low + high) / ;

        if (key == list[mid])

            return mid;

        else if (key < list[mid])

            high = mid - ;

        else

            low = mid + ;

    }

    return -;

}