冒泡排序

package com.lsd.sort;


public class MaoPaoSort {


public static void main(String[] args) {


int a[] = {0, 4,5,2,3,1};
maopaosort(a);
for (int i = 0; i < a.length; i++) {


System.out.println(a[i]);


}


}


public static void maopaosort(int[] a) {


int temp = 0;


for (int i = 0; i < a.length - 1; i++) {


for (int j = 0; j < a.length - 1 - i; j++) {


//第二个循环中都能得到得到最大的值
if (a[j] > a[j + 1]) {


temp = a[j];


a[j] = a[j + 1];


a[j + 1] = temp;


}


}
}


}
}