快速排序

简单的快速排序C++语言实现

#include<iostream>
using namespace std;
int a[100], n;
void qsort(int left, int right) {
	int i, j, t,temp;
	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) {
			t = a[i];
			a[i] = a[j];
			a[j] = t;
		}
	}
	a[left] = a[i];
	a[i] = temp;
	qsort(left, i-1);
	qsort(i + 1, right);
}
int main() {
	cin >> n;
	for (int i = 1; i <= n; i++)
		cin >> a[i];
	qsort(0, n);
	for (int i = 1; i <= n; i++)
		cout << a[i];
	cout << endl;
	return 0;
}