快排c++\c

#include<iostream>
using namespace std;
int partsort(int *arry, int low, int high)
{
	int pivot = arry[low];
	while (low < high)
	{
		while (low < high&&arry[high] >= pivot)
		{
			high--;
		}
		arry[low] = arry[high];
		while (low < high&&arry[low] <= pivot)
		{
			low++;
		}
		arry[high] = arry[low];
		
	}
	arry[low] = pivot;
return low;
}
void quickSort(int *arry,int low,int high)
{
	if (arry == NULL)
		return;
	if (low >= high)
	{
		return;
	}
	int mid = partsort(arry, low, high);
	quickSort(arry, low, mid - 1);
	quickSort(arry, mid + 1, high);
	
}
int main()
{
	int a[10] = { 5,9,6,9,8,7,12,4,0,-1 };
	quickSort(a, 0, 9);
	for (int i = 0; i < 9; i++)
	{
		cout << a[i] << endl;
	}
}