快速排序Qsort -- > C++

聊以慰藉.

.

.

.

 

#include <bits/stdc++.h>
#include <stdio.h>
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)

typedef long long ll;
const int maxn = 1e5+10;
const int mod =1e9+7;
const int inf = 0x3f3f3f3f;
using namespace std;

int a[maxn];
void Qsort(int *a,int st,int ed)
{
	if( st >= ed)
		return ;
	int mid = a[ed];
	int le = st,ri = ed-1;
	while( le < ri)
	{
		while(a[le] < mid && le < ri) {
		    le++;
		}
		while(a[ri] >= mid &&  le < ri) {
		    ri--;
		}
		swap(a[le],a[ri]);
	}
	if( a[le] >= a[ed])
		swap(a[le],a[ed]);
	else
		le++;
	Qsort(a,st,le-1);
	Qsort(a,le+1,ed);
}
int main(int argc, char const *argv[])
{
	int n;
	scanf("%d",&n);
	rep(i,1,n)
	{
		scanf("%d",&a[i]);
	}
	//sort(a+1,a+n+1);
	Qsort(a,1,n);
	rep(i,1,n)
	{
		printf("%d%c",a[i],i==n?'\n':' ');
	}
	return 0;
}