求解复数组 中模较大的N个数

//求解复数组 中模较大的N个数
void fianN_Complex(Complex outVec[], int& len, std::vector<int>& index,int N)   // Complex (&outVec)[512]  数组引用  单纯数组做参数退化为指针
{
    std::vector<double> modulus;
    for (size_t i = ; i < len; i++)
    {
        double temp;
        temp=sqrt(outVec[i].im*outVec[i].im + outVec[i].rl*outVec[i].rl);
        modulus.push_back(temp);
    }

    if (index.size()<N)
    {
        if (index.size()!=)
        {
            for (size_t i = ; i < index.size(); i++)
            {
                modulus[index[i]] = ;
            }
        }

        int indextemp = ;
        for (size_t j = ; j < modulus.size() - ; j++)
        {
            if (modulus[j]>modulus[j + ])
            {
                double temp = modulus[j];
                modulus[j] = modulus[j + ];
                modulus[j + ] = temp;
            }
            else
            {
                indextemp = j + ;
            }
        }
        index.push_back(indextemp);
    }

}