数组

public class QWE { public static void main(String[] args) { //模拟数据 int[] array = {52,63,14,59,68,35,8,67,45,99}; System.out.println(“原数组：”); for (int i : array) { System.out.print(i+" “); } System.out.println(); QWE (array); System.out.println(“排序后：”); for (int i : array) { System.out.print(i+” "); } }
public static void QWE (int[] arr){
for(int i = 0; i < arr.length-1; i++){ int min = i; for(int j = i+

数组最先出现在Python成神之路。