产生N个随机数并排序

void Test::CreateLossArray()
{

    //根据实际大小分配内存并清零
    int *pi= new int(m_iLossRate);
    memset(pi, 0, m_iLossRate * sizeof(int));

    srand((unsigned)time(0));

    //记录一共产生了多少次随机数
    int iCount = 1;

    for(int i = 0; i < m_iLossRate; i++)
    {
        //产生随机数（0-99）
        int ran_num = rand() % 100;
        qDebug("Count times:%4d, The %3dth Random number:%3d", iCount++, i, ran_num);

        //用于排序中记录逆序位置
        int iReposition = -1;

        //第一个随机数
        if(i == 0)
        {
            *(pi + i) = ran_num;
        }
        //后边的随机数
        else
        {
            int j = 0;
            //是否有逆序数
            for(; j < i; j++)
                if( ran_num < *(pi + j))
                {
                    //记录位置
                    iReposition = j;
                    break;
                }
                else if(ran_num == *(pi + j))
                {
                    //如果相等，则需要重新计算。
                    i--;
                    break;
                }
            //没有逆序数
            if(j == i)   //no less than ran_num
                *(pi + i) = ran_num;

            //如果有逆序数
            if(iReposition != -1)
            {
                //先将后边所有数据后移
                for(int k = i - 1; k >= iReposition; k--)   //copy back
                {
                    *(pi + k + 1) = *(pi + k);
                }

                //插入数据
                *(pi + iReposition) = ran_num;     //
            }
        }
        //qDebug("%d", ran_num);
    }

    pLossArray = pi;
}