一.递归算法
public static void kuaipai(int[] a,int left,int right){
if(left>right){
return ;
}
int i=left,j=right;
int tmp=a[left];
while(i<j){
while(tmp<=a[j]&&i<j){
j--;
}
while(tmp>=a[i]&i<j
一.递归算法
public static void kuaipai(int[] a,int left,int right){
if(left>right){
return ;
}
int i=left,j=right;
int tmp=a[left];
while(i<j){
while(tmp<=a[j]&&i<j){
j--;
}
while(tmp>=a[i]&i<j