摘要：void QuickSort1(int *s,int left,int right){ int i,j,t,pivot; if(left>right) return; if(left=pivot) j--; //从右向左找第一个比基准数小的数 while(iright) return;... 阅读全文

摘要：#include #include #include /** some good values for block size and count*/#define BLOCK_SIZE 8192#define BLOCK_COUNT 20/** function prototypes*/ stati... 阅读全文