JAVA实现排序-快速排序-递归实现快速排序

package quick;
//递归实现
public class QuickDigui {

public static void print(int[] arr){
for(int n=0;n<arr.length;n++){
System.out.print(arr[n]+" ");
}
System.out.println();
}

public static void fun(int[] a, int low, int high){
if(low<high){
int key = partition(a, low, high);//每次返回中间数字
fun(a, low, key-1);
fun(a, key+1, high);
}
}

public static int partition(int[] a, int low, int high){
int key = a[low];
while(low<high){
while(a[high]>=key&&low<high){//大于等于key的数组元素不需要移动
high--;
}
a[low] = a[high];
while(a[low]<=key&&low<high){//小于于等于key的数组元素不需要移动
low++;
}
a[high] = a[low];
}
a[low] = key;
print(a);
return low;
}

public static void main(String[] args) {
int[] arr = {49,38,65,97,76,13,27,49};
fun(arr, 0, arr.length-1);
}


}