快速排序

#include <iostream>  
#include <string>  
#include <math.h>  

using namespace std;

void show(int* a, int n) {
	for (int i = 0; i < n; i++) {
		cout << a[i] << ' ';
	}
}
//写法1
void QS1(int* a, int left, int right) {
	if (left > right) return;
	int Poit = a[left];
	int i = left, j = right;
	while (i != j) {
		while (a[j] >= Poit && i < j) j--;
		while (a[i] <= Poit && i < j) i++;
		if (i < j) {
			int tmp = a[i];
			a[i] = a[j];
			a[j] = tmp;
		}
	}
	a[left] = a[i];
	a[i] = Poit;
	QS1(a,left,i-1);
	QS1(a,i+1,right);
}
//写法2
void QS2(int* a, int left, int right) {
	//int mid = findmid(a, left, right);
	//quicksort(a,left,mid-1);
	//quicksort(a, mid+1, right);

	if (left < right) {
		int i = left, j = right, x = a[left];
		while (i < j) {
			while (i < j && a[j] >= x) {
				j--;
			}
			if (i < j) {
				a[i++] = a[j];
			}
			while (i < j && a[i] < x) {
				i++;
			}
			if (i < j) {
				a[j--] = a[i];
			}
		}
		a[i] = x;
		QS2(a , left, i - 1);
		QS2(a, i + 1, right);
	}
}
int main() {
	int a[] = {15,3,6,16,17,7,9,26,29,30,2,1,14};
	int n = sizeof(a) / sizeof(int);
	//show(a,n);
	//cout << endl;
	//quicksort(a, 0, n-1);

	QS2(a, 0, n - 1);
	show(a, n);
	return 0;
}