基础排序之快速排序

快速排序，方便以后查看

#include "iostream"
using namespace std;

void QuickSort(int array[],int left , int right);

int main(int argc, char const *argv[])
{
	int TestArray[] = {10,7,5,3,6};
	const int MAXNumber = 5;
	QuickSort(TestArray,0,MAXNumber -1);
	for (int i = 0; i < 5; ++i)
	 {
	 	cout<<TestArray[i]<<endl;
	 } 
	return 0;
}

void QuickSort(int array[],int left , int right){
	if (left < right)
	{
		int i = left;
		int j = right;
		int pivot = array[left];

		while(i < j && array[j] >= pivot){
			j--;
		}
		if (i < j )
		{
			array[i++] = array[j];
		}
		while(i < j && array[i] < pivot){
			i++;
		}
		if (i < j)
		{
			array[j--] = array[i];
		}

	
		array[i] = pivot;
		QuickSort(array,left,i - 1);
		QuickSort(array,i + 1 ,right);
	}
	
}