冒泡排序Java

int[]a= {1,5,8,7,3,9,5};
		int max=0;
		//a.length-1为外部大循环
		for (int i = 0; i < a.length-1; i++) {
			//a.length-1-i为内部小循环
			for (int j = 0; j < a.length-1-i; j++) {
				//如果a[j]>a[j+1]交换位置
				if (a[j]>a[j+1]) {
					int te=a[j];
					a[j]=a[j+1];
					a[j+1]=te;
				}
			}
		}
		for (int i = 0; i < a.length; i++) {
			System.out.println(a[i]);
		}