快速排序初尝试

#include <iostream>
using namespace std;
void quickSort(int a[],int left, int right)
{
	int i = left, j = right, normal = a[left];
	if (left >= right) return;
	while (i != j)
	{
		while (i < j && a[j] >= normal)
			j--;
		while (i < j && a[i] <= normal)
			i++;
		if (i < j)
			swap(a[i], a[j]);
	}
	a[left] = a[i];
	a[i] = normal;
	quickSort( a, left, i-1);
	quickSort(a, i + 1, right);
}
int main()
{
	int arr[5];
	for (int i = 0; i < 5; i++)
		cin >> arr[i];
	quickSort(arr, 0, 4);
	for (int i = 0; i < 5; i++)
		cout << arr[i] << " ";
	return 0;
}