操作方法
package com.liushuo; public class Test05 { public static void main(String[] args) { // 12,45,9,67,455,用冒泡排序实现升序排列。 int[] arr = { 12, 45, 9, 67, 455 }; for (int i = 0; i < arr.length - 1; i++) { for (int j = 0; j < arr.length - 1 - i; j++) { if (arr[j] > arr[j + 1]) { int temp; 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] + "\t"); } }