C++ QT 的快速排序 幾年之前寫的 現在複習下 呵呵

#include <QtCore/QCoreApplication>

 #include "iostream"

using namespace std;
void sort(int shuzu[],int left,int right)
{
int i(left),j(right),middle(0),tmp(0);
middle=shuzu[(qrand()%(right-left+1))+left];
do{
while((i<right)&&(shuzu[i]<middle))
i++;
while((j>left)&&(shuzu[j]>middle))
j--;
if(i<=j)
{
tmp=shuzu[j];
shuzu[j]=shuzu[i];
shuzu[i]=tmp;
i++;
j--;
}
}while(i<=j);//如果兩邊掃描的下標交錯，就停止（完成一次）
if(left<j)//如果左邊還有值
sort(shuzu,left,j);
if(i<right)//如果右邊還有值
sort(shuzu,i,right);
}

int main(int argc, char *argv[])
{
QCoreApplication a(argc, argv);
int data[]={10,9,8,7,6,5,4};
const int count(6);
cout<<"Dada";
sort(data,0,count);
for(int i(0);i!=7;++i)
{
cout<<data[i]<<" ";
}

// return 0;
return a.exec();
}