SCAU-8642-数据结构-快速排序

#include 
#include 

using namespace std;
int n;
void travel(int a[]) {
	for (int i = 0; i < n; i++) {
		cout << a[i] << " ";
	}
	cout << endl;
}
int partition(int a[],int low,int high) {
	//pivot是一个
	a[n] = a[low];
	while (low < high) {
		while (low= a[n]) { --high; };
		a[low] = a[high];
		while (low> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	a[n] = a[0];
	Qsort(a, 0, n-1);
	return 0;
}

易错点：1.忘记将最后a[low]=a[n];

tip;第n个位置是哨兵。