public class QuikSort {
public static void main(String[] args) {
int[] arr = {49,38,65,97,76,13,27,49};
Sort(arr,0,arr.length-1);
for(int i =0;i<arr.length;i++){
System.out.print(arr[i]+" ");
}
}
public static int partition(int[] arr,int low,int high){
int pivot = arr[low];
while(low<high){
while(low<high && arr[high]>=pivot){
--high;
}
arr[low] = arr[high];
while(low<high && arr[low]<=pivot){
++low;
}
arr[high] = arr[low];
}
arr[low]= pivot;
return low;
}
public static void Sort(int[] arr,int low,int high){
if(arr.length==0){
System.out.println("数组为空!");
return;
}
if(low < high){
int n = partition(arr,low,high);
Sort(arr,low,n-1);
Sort(arr,n+1,high);
}
}
}
“相关推荐”对你有帮助么?
-
非常没帮助
-
没帮助
-
一般
-
有帮助
-
非常有帮助
提交