快速排序

#include<iostream>

using namespace std;
/*数组作为函数形参，还得有个表示数组大小的形参，或者有表示数组索引的形参，因为数组作为形参时就变成了指针，sizeof(a)等于4，不等于20*/
void quickSort(int a[5], int low, int high){ //5可有可无
	if(low >= high)
		return;
	int left = low;
	int right = high;
	int key = a[left];
	while(left < right){
		while(left < right && a[right] >= key)
			--right;
		a[left] = a[right];
		while(left < right && a[left] <= key)
			++left;
		a[right] = a[left];
	}
	a[left] = key;
	quickSort(a, low, left - 1);
	quickSort(a, left + 1, high);
}
int main() {
	int array[] = {5, 4, 7, 2, 1};
	int size = sizeof(array) / sizeof(array[0]);
	quickSort(array, 0, size - 1);
	for(int i = 0; i < size; i++){
		cout<<array[i]<<" ";
	}

	return 0;
}