记录

[weixin_45951188]

#include <iostream>
using namespace std;

void Quicksort(int *arr,int begin,int end)
{
	if(begin>end) return;
	int tmp=arr[begin];
	int i=begin;
	int j=end;
	while(i!=j)
	{
		while(arr[j]<=tmp&&i<j)
			j--;
		while(arr[i]>=tmp&&i<j)
			i++;
		if(i<j)
		{
			int t;
			t=arr[i];
			arr[i]=arr[j];
			arr[j]=t;
		}
	}
		arr[begin]=arr[i];
		arr[i]=tmp;
		Quicksort(arr,begin,i-1);
		Quicksort(arr,i+1,end);
}

int main()
{
	int a[30]={1,10,2,9,3,8,4,7,5,6,11,13,15,17,19,12,14,16,18,20,21,23,25,27,29,22,24,26,28,30};
	int *p;
	p=a;
	Quicksort(p,0,29);
	for(int i=0;i<=29;i++)
	cout<<p[i]<<" ";
	return 0;
}