l9_5.cpp

来自「《数据结构（C++描述）》-李根强-源代码」· C++ 代码 · 共 43 行

//快速排序
#include<iostream.h>
typedef int ElemType;
const int n=10;
ElemType a[n]={2,6,4,8,10,7,1,5,3,9};
void quicksort(ElemType R[],int left , int right) 
{
  int i=left , j=right; ElemType temp=R[i];
  while (i<j)
  {
    while ((R[j]>temp)&&(j>i)) 
      j=j-1;
    if (j>i)
	{
     R[i]=R[j]; i=i+1;
     }
    while ((R[i]<=temp)&&(j>i))
      i=i+1;
    if (i<j)
	{
     R[j]=R[i]; j=j-1;
    }
  }
  R[i]=temp;
  if (left<i-1) quicksort(R,left,i-1);
  if (i+1<right) quicksort(R,i+1,right);
}

void print(ElemType r[n])
{ int i;
for(i=0;i<n;i++)
cout<<r[i]<<" ";
cout<<endl;
}
void main()
{ cout<<endl<<"排序前的结果为:"<<endl;
 print(a);
 quicksort(a,0,n-1);
 cout<<endl<<"排序后的结果为:"<<endl;
print(a);
}