十七

快速排序

模板void quick_sort(int q[], int l, int r){ if (l >= r) return; int i = l - 1, j = r + 1, x = q[l + r >> 1]; while (i < j) {

十七 Published on 2021-01-25
Previous Next