快速排序quick_sort

void swap(int a, int b) { int c = a; a = b; b = c; } void quick_sort(int q[], int l, int r)//L从0开始 { if (l >= r)return; int i = l - 1, j = r + 1, x =