快排模板

#include<iostream>    
#include<cstdio>  
#include<stdio.h>  
#include<cstring>    
#include<cstdio>    
#include<climits>    
#include<cmath>   
#include<vector>  
#include <bitset>  
#include<algorithm>    
#include <queue>  
#include<map>  
using namespace std;

//快速排序
int a[101], n;
void quicksort(int left, int right)
{
	int temp, i, j, t;
	if (left > right)
	{
		return;
	}
	temp = a[left];
	i = left;
	j = right;
	while (i!=j)
	{
		//顺序很重要，先从右往左
		while (a[j] >= temp&&i < j)
		{
			j--;
		}
		while (a[i] <= temp&&i < j)
		{
			i++;
		}
		if (i < j)//i,j没有相遇的时候
		{
			t = a[i];
			a[i] = a[j];
			a[j] = t;
		}
	}
	a[left] = a[i];
	a[i] = temp;
	quicksort(left, i - 1);//处理左边
	quicksort(i + 1, right);//处理右边
	return;
}
int main()
{
	int i, j;
	cin >> n;
	for (i = 1; i <= n; i++)
	{
		cin >> a[i];
	}
	quicksort(1, n);
	for (i = 1; i < n; i++)
	{
		cout << a[i] << " ";
	}
	cout << a[i] << endl;
}