快速排序 C 语言实现

#include<stdio.h>
void quickSort(int *arr, int left, int right);
int main()
{
	int arr[5] = {5, 6, 1, 3, 2};
	quickSort(arr, 0, 4);
	int i = 0;
	while (i < 5)
	{
		printf("%d\t", arr[i]);
		i++;
	}
	system("pause");
	return 0;
}
void quickSort(int *arr, int left, int right)
{
	if (left >= right) {
		return;
	}
	int i = left;
	int j = right;
	int key = arr[left];
	while (i < j)
	{
		while (i < j && key <= arr[j])
		{
			j--;
		}
		arr[i] = arr[j];
		while (i < j && arr[i] <= key)
		{
			i++;
		}
		arr[j] = arr[i];
	}
	arr[i] = key;
	quickSort(arr, left, i - 1);
	quickSort(arr, i + 1, right);
}