排序-冒泡排序简单实现

package singleTon;

public class Algorilthm01 {
	//冒泡排序
public static void main(String[] args) {
	int[] zz = {9,44,541,12,32,45,64,74,751,254,235,4};
	for (int i = 0; i < zz.length-1; i++) {//需要查找zz.length-1就可以排序完成
		for (int j = 0; j < zz.length-i-1; j++) { //每次查找的范围都是随着i++而缩小的
			if (zz[j]>zz[j+1]) {
				int temp;
				temp=zz[j];
				zz[j]=zz[j+1];
				zz[j+1]=temp;
			}
		}
		System.out.println("第"+(i+1)+"次查找该数组");
		for (int a = 0; a < zz.length; a++) {
			System.out.println(zz[a]);
		}
	}
	for (int a = 0; a < zz.length; a++) {
		System.out.println(zz[a]);
	}
}
}