3.排序：冒泡排序法

对int[] sorts = { 20, 9, 4, 7, 2, 6, 8, 1 };进行排序

 

package com.tao.test;

/**
 * 冒泡排序法
 * 
 */
public class TestBubbleSort {
	public static void main(String[] args) {
		int[] sorts = { 20, 9, 4, 7, 2, 6, 8, 1 };
		TestBubbleSort tbs = new TestBubbleSort();
		tbs.bubbleSort(sorts);
	}

	public void bubbleSort(int[] sorts) {
		output(sorts);
		int n = sorts.length;
		for (int i = 0; i < n; i++) {
			for (int j = 1; j < n - i; j++) {
				if (sorts[j - 1] > sorts[j]) {
					int temp = sorts[j];
					sorts[j] = sorts[j - 1];
					sorts[j - 1] = temp;
				}
			}
			output(sorts);
		}
	}

	/**
	 * 用于输出信息
	 * 
	 * @param sorts
	 */
	public void output(int[] sorts) {
		for (int i = 0; i < sorts.length; i++) {
			System.out.print("  " + sorts[i]);
		}
		System.out.println();
	}
}