java冒泡排序

用java做一个冒泡排序

public class mao {
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int num[] = { 90, 56, 12, 57 };
		System.out.println("数组排序前的顺序：");
		for (int i = 0; i < num.length; i++) {
			System.out.println(num[i] + "");
		}
		int temp;
		for (int i = 0; i < num.length - 1; i++) {// 总共需要比较3轮
			for (int j = 0; j < num.length - i - 1; j++) {// 每轮比较
				if (num[j] > num[j + 1]) {
					temp = num[j];
					num[j] = num[j + 1];
					num[j + 1] = temp;

				}
			}
		}
		System.out.println("排序后的顺序是：");
		for (int i1 = 0; i1 < num.length; i1++) {
			System.out.println(num[i1] + " ");
		}

	}
}

运行截图