template<class T>

void shellSort(vector<T> &v)

{

    for(int gap = v.size() / ; gap > ; gap /= )  // 这里gap > 0也可换成gap >= 1

    {

        for(int i = gap; i < v.size(); ++i)

        {

            T tmp = v[i];

            int j = i;

            for(; j >= gap && tmp < v[j - gap]; j -= gap)

                v[j] = v[j - gap];

            v[j] = tmp;

        }

    }

}