public class Test25 {
public static void main(String[] args) {
// 冒泡法
int[] array = new int[] { 12, 34, 45, 56, 67, 56 };
int[][] arrayList =new int[][]{{},{}};
for (int j = 0; j < array.length - 1; j++) {
for (int i = 0; i < array.length - 1 - j; i++) {
if (array[i] > array[i + 1]) {
int temp = array[i];
array[i] = array[i + 1];
array[i + 1] = temp;
}
}
}
System.out.println("排序后。。。。。。。。。。");
for (int i = 0; i < array.length; i++) {
System.out.println(array[i] + "\t");
}
}
}