输入包括两行,第一行是一个正整数N(N

#include
int a[1100001];
int pp(int low,int h)
{
 int key=a[low];
 while(low < h)
 {
  while(key <= a[h] && low < h)  h--;
  a[low]=a[h];
  while(key >= a[low] && low < h) low++;
  a[h]=a[low];
 }
 a[low]=key;
 return low;
}
void paixu(int low, int h)
{
 if(low>=h)
	 return ;
 int mid=pp(low,h);
 paixu(low,mid-1);
 paixu(mid+1,h);
}
int main()
{
 int i;
 int n;
 scanf("%d",&n);
 for(i=0;i=0; i--)
 {
     printf("%d", a[i]);
	 if(i>0)
		 printf(" ");
 else
	 printf("\n");
 }
 return 0;
}



你可能感兴趣的:(排序算法)