package com.company.test3;
public class MyQuiteSortDemo {
public static void main(String[] args) {
int[] arr={6,1,2,7,9,3,1,4,5,10,18};
quiteSOrt(arr,0,arr.length-1);
for (int i = 0; i < arr.length; i++) {
System.out.println(arr[i]+" ");
}
}
private static void quiteSOrt(int[] arr, int left, int right) {
if(right<left){
return;
}
int left0=left;
int right0=right;
int baseNumber = arr[left0];
while (left!=right){
while (arr[right]>=baseNumber&&right>left){
right--;
}
while (arr[left]<=baseNumber&&right>left){
left++;
}
int temp =arr[left];
arr[left]=arr[right];
arr[right]=temp;
}
int temp =arr[left];
arr[left]=arr[left0];
arr[left0]=temp;
quiteSOrt(arr,left0,left-1);
quiteSOrt(arr,left+1,right0);
}
}
快速排序练习
最新推荐文章于 2024-07-24 20:25:39 发布