Java 冒泡排序法

public class Test {public static void main(String[] args) {int m[] = {5,8,1,3,6,7,2,9};for(int i = 0 ;i < m.length; i++){for(int j = 0; j < m.length - i - 1; j++){ int a = m[j]; int b = m[j + 1]; // if(m[j] < m[j + 1])// {// m[j+1] = m[j];// m[j] = m[j + 1];// } //相邻连个是u对比，如果前面的数小于后面得数 ，则将小的书放到前面 if(a < b) { m[j+1] = a; m[j] = b; } System.out.print(m[j]+".");}}System.out.println();for (int i : m) {System.out.print(i+".");}}}