随机排序

#include<iostream>
#include<time.h>
using namespace std;
int GetPos(int* piScr,int iStartIndex,int iEndIndex)
{
    int iPos = iStartIndex;
    int iLeftIndex = iStartIndex  + 1;
    int iRightIndex = iEndIndex;
    int iPosValue = piScr[iPos];
    int iTemp = 0;
    while(true)
    {
        while(piScr[iLeftIndex] < iPosValue && iLeftIndex <= iEndIndex)
        {
            iLeftIndex++;
        }    
        while(piScr[iRightIndex] > iPosValue)
        {
            iRightIndex--;
        }
        if(iRightIndex < iLeftIndex)
        {
            break;
        }
        else
        {
            iTemp = piScr[iLeftIndex];
            piScr[iLeftIndex] = piScr[iRightIndex];
            piScr[iRightIndex] = iTemp;
        }            
    }  
    iTemp = piScr[iRightIndex];
    piScr[iRightIndex] = iPosValue;
    piScr[iPos] = iTemp;
    return iRightIndex;  
}    
int GetPosRandom(int* piScr,int iStartIndex ,int iEndIndex)
{
    //generate a number between [iStartIndex,iEndIndex];
    srand(time(NULL)); // seed the random-number generator with the current time 
    int iRand =(int) ((double)rand()/(double)RAND_MAX )* iEndIndex  + iStartIndex; 
    int iTemp = 0;
    iTemp = piScr[iStartIndex];
    piScr[iStartIndex] = piScr[iRand];
    piScr[iRand] = iTemp;
    return GetPos(piScr,iStartIndex,iEndIndex);
} 
void RandQSort(int* ipScr,int iStartIndex,int iEndIndex)
{
    if(iStartIndex < iEndIndex)
    {
        int iPos = GetPosRandom(ipScr,iStartIndex,iEndIndex);
        RandQSort(ipScr,iStartIndex,iPos -1 );
        RandQSort(ipScr,iPos + 1, iEndIndex);
    }    
}       
int main()
{
    int aiTest[100];
    for(int i =0 ;i< 100 ; i++)
    {
        aiTest[i] = 100 -i;
    }
    RandQSort(aiTest,0,99);
    for(int i =0 ;i< 100;i++)
    {
        cout<<aiTest[i]<<endl;
    }        
    system("pause");
    return 0;
}    

 
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值