0
点赞
收藏
分享

微信扫一扫

经典快排

小龟老师 2023-01-21 阅读 131


import java.util.Arrays;

public class quickSort {

public static void quickSort(int[] arr){
quickSort(arr,0,arr.length-1);
}
public static void quickSort(int[] arr,int low,int high){
if(low<high){
int pos = partition(arr,low,high);
quickSort(arr,low,pos-1);
quickSort(arr,pos+1,high);
}
}
public static int partition(int[] arr,int low,int high){
int base = arr[low];
while (low<high){
while (low<high&&arr[high]>=base){
high--;
}
arr[low] = arr[high];
while (low<high&&arr[low]<=base){
low++;
}
arr[high] = arr[low];
}
arr[low] = base;
return low;
}

public static void main(String[] args) {
int [] arr = {3,2,5,4,6,8,1,2,6,9,7};
System.out.println(Arrays.toString(arr));
quickSort(arr);
System.out.println(Arrays.toString(arr));
}

}


举报

相关推荐

链表快排

快排+归并

C++快排

归并和快排

java递归快排

js 实现快排

0 条评论