摘要： 复习快速排序，用C语言实现：#include int quicksort(int begin, int end, int a[], int len);void main(){ int a[] = {33, 22, 6, 5, 7, 3, 8, 9}; int len = sizeof(a)/sizeof(int); int i=0; int j=len-1; int pivot; pivot = quicksort(i, j, a, len);//printf("\npivot:%d\n", pivot); //for(i=0; ikey && j>= 阅读全文