public class tex1_num1 {
public static void main(String[] args) {
int[] arr = new int[]{1,4,2,6,7,9};
quick_sort_1(arr);
println_arr(arr);
}
public static void println_arr(int[] arr){
System.out.println("-------------------------------");
for (int i : arr) {
System.out.print(i + " ");
}
System.out.println("");
System.out.println("-------------------------------");
}
public static void quick_sort_1(int[] arr){
quick_sort_2(arr,0,arr.length-1);
}
public static void quick_sort_2(int[] arr,int left,int right){
if (left > right){
return;
}
int pre = left;
int rear = right;
int cache = arr[left];
while(pre < rear){
while(arr[rear] >= cache && pre < rear){
rear--;
}
while(arr[pre] <= cache && pre < rear){
pre++;
}
if(pre < rear){
int cache0 = arr[pre];
arr[pre] = arr[rear];
arr[rear] = cache0;
}
arr[left] = arr[pre];
arr[pre] = cache;
quick_sort_2(arr, left, pre-1);
quick_sort_2(arr,rear+1,right);
}
}
}
Java中的快速排序源代码
最新推荐文章于 2024-01-02 14:03:12 发布