public class Sort {
public static void main(String[] args){
Sort bubbleSort = new Sort();
int[] b = {2,1,4,3,0};
System.out.println("快速排序: ");
bubbleSort.quickSort(b, 0, b.length - 1);
for (int i : b) {
System.out.print(i + " ");
}
}
//快速排序
public int getMid(int[] arr, int start, int end){
int flag = arr[start];
while(start < end){
while(start < end && arr[end] > flag){
end --;
}
if(start < end) arr[start++] = arr[end];
while(start < end && arr[start] < flag){
start ++;
}
if(start < end) arr[end--] = arr[start];
}
arr[end] = flag;
return end;
}
public void quickSort(int[] arr, int start, int end){
if(start < end){
int mid = getMid(arr, start, end);
quickSort(arr, start, mid-1);
quickSort(arr, mid+1, end);
}
}
}
快速排序
最新推荐文章于 2024-07-17 10:35:12 发布