[数据结构]快速排序

代码如下：、

#include<stdio.h>#include<stdlib.h>#include<string.h>static int lookbase(int *array,int left,int right){int i=left;int j=right;int temp=array[i];while(i < j){while((i<j) && (array[j]>=temp)){j--;}array[i]=array[j];while((i<j)&&(array[i]<=temp)){i++;}array[j]=array[i];}array[i]=temp;return i;}static int* quicksort(int *src,int left,int right){int base;if(left < right){base = lookbase(src,left,right);quicksort(src,left,base-1);quicksort(src,base+1,right);}return src;}int main(){int array[]={3,2,5,1,5,7,2,7,2,6};int *result;result = quicksort(array,0,9);int i=0;for(i;i<10;i++){printf("%d\n",*(result+i));}return 0;}