staticvoidquickSort(int[]q,int l,int r){// l 数组左下标,r数组右下标if(l>=r)return;int t =0;int j = r+1;int i = l-1;int x = q[l];while(i<j){do i++;while(q[i]<x);do j--;while(q[j]>x);if(i<j){
t = q[i];
q[i]= q[j];
q[j]= t;}}quickSort(q,l,j);quickSort(q,j+1,r);}
模板static void quickSort(int []q,int l,int r) {// l 数组左下标,r数组右下标 if(l>=r) return; int t = 0; int j = r+1; int i = l-1; int x = q[l]; while(i<j) { do i++;while(q[i]<x); do j--;while(q[j]>x); if(i<j) { t = q[i];