排序-冒泡排序

import java.util.Arrays;

//冒泡排序
public class demo_1129_02 {

/**
 * @param args
 */
public static void main(String[] args) {
	// TODO Auto-generated method stub
	int[] a={3,1,5,2,4,9,7,0};

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

	for (int i = 0; i < a.length-1-j; i++) {
		if (a[i]>a[i+1]) {
			int temp=a[i+1];
			a[i+1]=a[i];
			a[i]=temp;
		}
		
	}

}
	System.out.println(Arrays.toString(a));

}
}