摘要：
1.快速排序//By LYLtimvoid swap(int *a, int *b){ int t = *a; *a = *b; *b = t; }void QSort(int l, int r){ int lp = l, rp = r, m = (l + r) >> 1; while (lp a[m]) rp--; if (lp > 1; sort(start, mid); sort(mid+1, end); merge(start, mid, end); }}3.希尔排序//By LYLtimvoid ShellSort(int a[], unsigned n){ uns 阅读全文