写出快速排序的实现代码

public class Test1 { public static void main(String[] args) { int[] arr = {6,1,2,5,9,3,4,7,10,8}; Quick_Sort(arr,0,arr.length -1); for(int i=0;i<arr.length>end) return; int tmp=arr[begin]; int i=begin; int j=end; while(i!=j) { while(arr[j]>=tmp&&j>i) j–; while(arr[i]<=tmp&&j>i) i++; if(j>i) { int t=arr[i]; arr[i]=arr[j]; arr[j]=t; } } arr[begin]=arr[i]; arr[i]=tmp; Quick_Sort(arr,begin,i-1); Quick_Sort(arr,i+1,end); } }</arr.length>

36:29