摘要：快排 void quick_sort(int a[], int l, int r) { if (l >= r)return; int p = a[l]; int i = l - 1, j = r + 1;//左右各移动一格，配合do-while while (i < j) { do i++; whi 阅读全文