冒泡排序

	public static void main(String[] args) {
		int[] num = {6,5,9,8,45,2,3,55,1};
//		Arrays.sort(num);
		for (int i = 0; i < num.length-1; i++) {
			for (int j = i+1; j < num.length; j++) {
				if(num[i]>num[j]){
					int temp = num[i];
					num[i] = num[j];
					num[j] = temp;
					System.out.println(Arrays.toString(num)+"-----"+i);
				}
			}
		}
	}

 打印結果:

[5, 6, 9, 8, 45, 2, 3, 55, 1]-----0
[2, 6, 9, 8, 45, 5, 3, 55, 1]-----0
[1, 6, 9, 8, 45, 5, 3, 55, 2]-----0
[1, 5, 9, 8, 45, 6, 3, 55, 2]-----1
[1, 3, 9, 8, 45, 6, 5, 55, 2]-----1
[1, 2, 9, 8, 45, 6, 5, 55, 3]-----1
[1, 2, 8, 9, 45, 6, 5, 55, 3]-----2
[1, 2, 6, 9, 45, 8, 5, 55, 3]-----2
[1, 2, 5, 9, 45, 8, 6, 55, 3]-----2
[1, 2, 3, 9, 45, 8, 6, 55, 5]-----2
[1, 2, 3, 8, 45, 9, 6, 55, 5]-----3
[1, 2, 3, 6, 45, 9, 8, 55, 5]-----3
[1, 2, 3, 5, 45, 9, 8, 55, 6]-----3
[1, 2, 3, 5, 9, 45, 8, 55, 6]-----4
[1, 2, 3, 5, 8, 45, 9, 55, 6]-----4
[1, 2, 3, 5, 6, 45, 9, 55, 8]-----4
[1, 2, 3, 5, 6, 9, 45, 55, 8]-----5
[1, 2, 3, 5, 6, 8, 45, 55, 9]-----5
[1, 2, 3, 5, 6, 8, 9, 55, 45]-----6
[1, 2, 3, 5, 6, 8, 9, 45, 55]-----7

發佈了39 篇原創文章 · 獲贊 1 · 訪問量 3萬+
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.
相關文章