用c++编写不用递归的QuickSort排序

用c++编写不用递归的QuickSort排序

#include <iostream.h>
void main()
{
int i,j,x,mix,mix_1;
int arr[10]={5,2,9,4,6,8,1,7,3,0};
for(i=0;i<=9;i++)
{
mix = arr[i];
mix_1 = i;
for(j=i;j<=9;j++)
{
if(arr[j] < mix)
{
mix = arr[j];
mix_1 = j;
}
}
x = arr[i];
arr[i] = arr[mix_1];
arr[mix_1] = x;
}
cout<<"输出效果如下："<<endl;
for (i=0;i<=9;i++)
{
cout<<arr[i]<<"\t";
}
}