冒泡排序

冒泡排序：

public static void main(String[] args) { int[] a = {1,2,3,5,7,88,2,4}; for (int i = 0; i < a.length-1; i++) { for (int j = i+1; j < a.length; j++) { if(a[i]>a[j]) { int temp = a[i]; a[i] = a[j]; a[j] = temp; } } } for (int i = 0; i < a.length; i++) { System.out.print(a[i]+","); } }