/** * Created by 10257527 on 2019/5/9. */ public class MaoPao { public static void main(String[] args) { int[] arr = new int[10]; arr = new int[]{12,45,67,23,543,32,453,543,432,43,1}; //冒泡排序算法 for (int i = 0; i < arr.length-1; i++) { for (int j = 0; j < arr.length-i-1; j++) { if (arr[j]> arr[j+1]) { int temp = arr[j]; arr[j] = arr[j+1]; arr[j+1] = temp ; } } } System.out.println("***********************"); for (int i = 0; i < arr.length; i++) { System.out.print(" arr["+i + "] = " + arr[i]+"\t"); } } }
结果
***********************
arr[0] = 1 arr[1] = 12 arr[2] = 23 arr[3] = 32 arr[4] = 43 arr[5] = 45 arr[6] = 67 arr[7] = 432 arr[8] = 453 arr[9] = 543 arr[10] = 543