Garry

package com.zjl.排序;import java.util.Arrays;/** * Created by zjl 2022/5/10 **/public class 快速排序 { public static void main(String[] args) { // 定义一个数组 int[] arr = { 6, 3, 7, 9, 5, 1, 4, 8 }; quickSort(arr, 0, arr.length - 1); System.

public static void main(String[] args) { int SourceArray[] = {2,3,1,4,8,9,7,6,5,0}; // 对 arr 进行拷贝，不改变参数内容 int[] arr = Arrays.copyOf(SourceArray, SourceArray.length); for (int i = 0; i < arr.length - 1; i++) { //会进行（arr.length - 1）轮比较 for (i

public static void main(String[] args) { int sourceArray[] = {2,3,1,4,8,9,7,6,5,0}; int[] arr = Arrays.copyOf(sourceArray, sourceArray.length); // 总共要经过 N-1 轮比较 for (int i = 0; i < arr.length - 1; i++) { int min = i; // 每轮需要比较的次数 N-i