上面就是快速排序的一些简述.
代码如下:
#include "myQuickSort.h"
#include <stdlib.h>
void changeSomeThing(int *a,int *b)
{int c = *a;*a = *b;*b = c;
}
void myQuickSortShow(int *Array, int begin, int end)
{int middle = 0;int change = 0;int index = 0;if(begin<end){middle = (rand()%(end-begin+1))+begin;changeSomeThing(&Array[middle], &Array[end]);change =begin;for(index= begin; index !=end; index++){if(Array[index]<Array[end]){changeSomeThing(&Array[index], &Array......
阅读全文