package Step2.Day26; public class changesort { public static void main(String[] args) { int a[] = {8,9,5,2,4,3,7}; for (int num: a) { System.out.print(num+" "); } for (int i = 0; i < a.length-1; i++) { int min = i; for (int j = i+1; j < a.length; j++) { if (a[j]<a[min]){ min = j; } } if(i != min){ //交换a[i]和a[min] int temp = a[i]; a[i] = a[min]; a[min] = temp; } } System.out.println("----------------------------"); for (int num:a ) { System.out.print(num + ","); } } }
选择排序 Java
最新推荐文章于 2024-06-20 20:20:21 发布