详细说明一个快速排序的例子

#include <stdio.h>
#include <stdlib.h>

void swap(int A[],int i,int j)
{
	int temp=0;
	if(A[i]>A[j])
	{
		temp=A[j];
		A[j]=A[i];		
		A[i]=temp;			
	}	
}

/* 快速排序 */
void quick_sort(int x[],int left, int right)
{
   int temp = left;
   int i;
   if (left >= right)
        return;
    
    for (i = left+1; i<= right; i++)
    {
        if(x[i] < x[left])
            swap(x, ++temp, i);
    }
    swap(x, left, temp);
    quick_sort(x,left, temp-1);
    quick_sort(x,temp+1, right);
}

int main()
{
	int number[]={10,9,8,7,6,5,4,3,2,1};
    int i=0,len;
	printf("start ....\n");	
	len=(int)sizeof(number)/sizeof(*number);
	printf("len =%d\n",len);	
    quick_sort(number,0,9);
	for(i=0;i<10;i++)
	{
	  printf("%d ",number[i] );				
	}
     printf("\n");		
     printf("end ....\n");		
	exit(0);
}