class Solution {
public void swap(int[]q, int l, int r){
int temp = q[l];
q[l] = q[r];
q[r] = temp;
}
public int quickSelect(int[]q, int l, int r, int k){
// 基于快排的快选
// 快排模板:
if(l>=r) return q[k];
int i = l-1, j=r+1, x = q[l+r>>1];
System.out.println(x);
while(ix);
do{j--;} while(q[j]=k) return quickSelect(q, l, j, k);
else {
System.out.println(Arrays.toString(q)+" "+r);
return quickSelect(q, j+1, r, k);
}
}
public void quickSort(int[]q, int l, int r){
// 快排(降序)
if(l>=r) return;
int i = l-1, j=r+1, x = q[l+r>>1];
while(ix);
do{j--;} while(q[j]