快速，插入，希尔排序C实现

排序算法 int partion(int a[],int left,int right) { int base=a[left]; while (left<right) { while(left<right && a[right]>base) --right; a[left]=a[right]; while(left<right && a[left]<base) ++left; a[right]=a[left]; } a[left]=base; return left; } void quicksort(int a[],int left,int right) { int i; if (left<right) { i=partion(a,left,right); quicksort(a,left,i-1); quicksort(a,i+1,right); } }