quick sort

#include <stdio.h>

#define ARR_SIZE(arr) sizeof(arr)/sizeof(arr[0])
#define CHIRS_CODE

void print_arr(int arr[], int len)
{
	int i=0;
	for (;i<len;i++)
		printf("%d, ", arr[i]);
	printf("\n");
}	

void quicksort(int arr[], int left, int right)
{
	if (left >= right) return;

	int key = arr[left];
	int start = left;
	int end = right;
	while(left < right)
	{
		while (left < right && key < arr[right]) right--;
		// 这里的left++ 用于防止出现A[left]等于A[right]的状况
		if (left < right) arr[left++] = arr[right];
		while (left < right && key > arr[left] ) left++;
		// 这里的right--用于防止出现A[left]等于A[right]的状况
		if (left < right) arr[right--] = arr[left];
	}
	arr[left] = key;

	quicksort(arr, start, left-1);
	quicksort(arr, left+1, end);
}

void main()
{
	int arr[] = {1, 9, 4, 5, 8, 6, 0, 3, 2, 7, 98, 73, 23, 63, 7, 45};
	//int arr[] = {1, 4, 5, 8, 6};
	printf("before sort:\n");
	print_arr(arr, ARR_SIZE(arr));

	quicksort(arr, 0, ARR_SIZE(arr) - 1);

	printf("after sort:\n");
	print_arr(arr, ARR_SIZE(arr));
}

参考:

http://en.wikipedia.org/wiki/Quicksort