Java冒泡排序算法 - JAVA

* the array of generic T */ public > void doSortT(T[] array) { int length = array.length; boolean flag = true; for (int i = 0; i < length - 1 && flag; i++) { flag = false; for (int j = 0; j < length - i - 1; j++) { if (array[j].compareTo(array[j + 1]) > 0) { Swapper.swap(j, j + 1, array); flag = true; } } } } } 测试TestBubbleSortord：

package com.meritit.sortord.bubble;

import java.util.Arrays;

public class TestBubbleSortord {
	/**
	 * Test
	 * 
	 * @param args
	 */
	public static void main(String[] args) {
		BubbleSortord bubbleSort = BubbleSortord.getInstance();
		int[] array = { 25, 36, 21, 45, 98, 13 };
		System.out.println(Arrays.toString(array));
		bubbleSort.doSort(array);
		System.out.println(Arrays.toString(array));
		System.out.println(------------------------);
		Integer[] arrays = { 25, 35, 11, 45, 98, 65 };
		System.out.println(Arrays.toString(arrays));
		bubbleSort.doSortT(arrays);
		System.out.println(Arrays.toString(arrays));
	}
}

冒泡排序算法详解：http://blog.csdn.net/ysjian_pingcx/article/details/8653732 冒泡排序算法源码免积分下载：http://download.csdn.net/detail/ysjian_pingcx/6755209

Java冒泡排序算法(二)