【排序之快排】

#include <stdio.h>

void QuickSort(int a[], int left,int right);


void QuickSort(int a[], int left,int right) {
    int i,j,t,temp;
    if(left>right)
       return;                      
    temp= a[left]; //temp中存的就是基准数
    i=left;
    j=right;
    while(i!=j)
    {
        //顺序很重要，要先从右边开始找
        while(a[j]>=temp && i<j) j--;
        //再找右边的
        while(a[i]<=temp && i<j) i++;
        //交换两个数在数组中的位置
        if(i<j)
        {
            t=a[i];
            a[i]=a[j];
            a[j]=t;
        }
    }
    //最终将基准数归位
    a[left]=a[i];
    a[i]=temp;                      
    QuickSort(a, left,i-1);//继续处理左边的，这里是一个递归的过程
    QuickSort(a, i+1,right);//继续处理右边的 ，这里是一个递归的过程
}

void Print(int a[], int n) {
	for(int i = 0; i < n; i++) {
		printf("%d ", a[i]);
	}
}

int main() {
	int array[10] = { 200, 11, 23, 55, 16, 29, 89, 99, 293, 18};
	QuickSort(array, 0, 9);
	Print(array, 10);
}

#include <stdio.h>

int Partition(int A[], int low, int high);
void QuickSort(int A[], int low, int high);

void QuickSort(int A[], int low, int high) {
	if (low < high) {
		int pivotpos = Partition(A, low, high);
		QuickSort(A, low, pivotpos-1);
		QuickSort(A, pivotpos+1, high);
	}
}

int Partition(int A[], int low, int high) {
	int pivot = A[low];
	while(low < high) {
		while(low < high && A[high] >= pivot) --high;
		A[low] = A[high];
		while(low < high && A[low] <= pivot) ++low;
		A[high] = A[low];
	}
	A[low] = pivot;
	return low;
} 

void Print(int a[], int n) {
	for(int i = 0; i < n; i++) {
		printf("%d ", a[i]);
	}
}

int main() {
	int array[10] = { 200, 11, 23, 55, 16, 29, 89, 99, 293, 18};
	QuickSort(array, 0, 9);
	Print(array, 10);
}