/QuickSort.cpp#includeusingstd:cout;usingstd:endl;voidQuickSort(int*pData,intleft,intright)inti(left);intj(right);intmiddle(0);intiTemp(0);right的随机数middle=pData(left+right)/2;求中间值middle=pData(rand()%(right-left+1)+left;/生成大于等于left小于等于dowhile(pDataimiddle)&(imiddle)&(jleft)/从右扫描小于中值的数j-;/找到了一对值,交换if(i=j)iTemp=pDataj;pDataj=pDatai;pDatai=iTemp;i+;j-;(leftj)，while(i=j);如果两边扫描的下标交错，就停止(完成一次)当左边部分有值递归左半边if(lefti),递归右半边if(righti)QuickSort(pData,i,right);intmain()intdata=37,8,321,12,100,1,50,6,452,65,1,99,7;constintcount(12);QuickSort(data,0,count);for(inti(0);i13;i+)coutdatai;coutendl;return0;#