1 /* 2 * 冒泡排序 3 * 外层控制循环多少趟,内层控制每一趟的循环次数 4 */ 5 public class Test08 { 6 public static void main(String[] args) { 7 int num[] = {1,9,2,8,4,7,6,5,3}; 8 System.out.println("排序前的数组为:"); 9 for (int snum:num) { 10 System.out.print(snum+""); 11 } 12 for (int i = 1; i < num.length; i++) { 13 for (int j = 1; j < num.length-i; j++) { 14 if (num[j]>num[j+1]) { 15 int temp = num[j]; 16 num[j] = num[j+1]; 17 num[j+1] = temp; 18 } 19 } 20 } 21 System.out.println(); 22 System.out.println("排序后的数组为:"); 23 for (int snum:num) { 24 System.out.print(snum+""); 25 } 26 } 27 }
https://www.cnblogs.com/shen-hua/p/5422676.html