冒泡排序java实现

package Test1;
import java.io.IOException;

public class Test01{
 public static void main(String []args) {
     //冒泡排序
		int[] a = new int[] {1,5,8,2,3,9,4};
		int i ,j;
		for (i = 0; i < a.length - 1; i++) {	
			for (j = 0; j < a.length - 1 - i; j++) {
				if (a[j] > a[j+1]) {
					int temp = a[j];
					a[j] = a[j+1];
					a[j+1] = temp;	
				}
			}
		}
		for (i = 0; i < a.length; i++) {
			System.out.print(a[i]+ " ");
		}
	}
}