Sort

排序方法

快速排序：

QuickSort

void QuickSort(int *array, int left, int right){
	if(left<right){
		int zuo = left;
		int midnum = array[left];
		int you = right;
		while(zuo < you){
			while(zuo < you && array[you] >= midnum){
				you -- ;
			}
			if(zuo < you){
				array[zuo] = array[you];
			}
			while(zuo < you && array[zuo] <= midnum){
				zuo ++;
			}
			if(zuo < you){
				array[you] = array[zuo];
			}
		}
		array[zuo] = midnum;
		QuickSort(array,left,zuo -1);
		QuickSort(array,zuo+1,right);
	}
}

快速排序算法——C/C++

持续更新ing;