java氣泡排序

package com.algorithm;

/**
 * @Description 冒泡
 * @author FuJianyong
 * 2015-1-22上午09:58:39
 */
public class MaoPao {
	public static void main(String[] args) {
		int[] mao = {17,50,26,18,9,100,88};//靜態分配陣列初始數值
		int temp = 0; 
		//外部迴圈執行遍歷冒泡
		for(int i=0;i<mao.length;i++) {
			//內部迴圈執行相鄰兩個陣列比較，大的就冒泡
			for(int j=0;j<mao.length-1;j++) {
				//如果左邊的陣列大於右邊的陣列
				if(mao[j]>mao[j+1]) {
					temp = mao[j+1];//右邊的陣列賦值給臨時物件
					mao[j+1] = mao[j];//左邊的陣列賦值給右邊的陣列
					mao[j] = temp;//臨時物件賦值給左邊的陣列
				}
			}
		}
		for(int i=0;i<mao.length;i++) {
			System.out.print(" "+mao[i]);
		}
	}
}