排序算法 之 冒泡排序

 

package practice.algorithm.sort;

import java.util.Arrays;
import java.util.Date;
import java.util.HashSet;
import java.util.Random;
import java.util.Set;

public abstract class BubbleSort {

	public static Comparable[] bubbleSort(Comparable[] arr) {
		return bubbleSort(arr, true);
	}
	
	public static Comparable[] bubbleSort(Comparable[] arr, boolean asc) {
		if (arr == null || arr.length == 0)  {
			return arr;
        }
		int arrLength = arr.length;
		for (int i = 0; i < arrLength - 1; i++) {
			for (int j = 0; j < arrLength - i - 1; j++) {
				int state = arr[j].compareTo(arr[j + 1]);
				if (asc ? state > 0 : state < 0) {
					Comparable temp = arr[j];
					arr[j] = arr[j + 1];
					arr[j + 1]  = temp;
				}
			}
		}
		return arr;
	}
	
        //--------------  Test Code  ----------------
	private static Integer[] generateArray(int num) {
		Set<Integer> set = new HashSet<Integer>();
		Random rand = new Random(new Date().getTime());
		int max = num * 10;
		for (int i = 0; i < num;) {
			int n = rand.nextInt(max);
			if (set.contains(n))
				continue;
			set.add(n);
			i++;
		}
		return set.toArray(new Integer[num]);
	}
	
	public static void main(String[] args) {
		Integer[] ints = generateArray(100);
		System.out.println("======== Bubble Sort ========");
		System.out.println("Before : " + Arrays.toString(ints));
		
		long timeBefore = System.nanoTime();
		BubbleSort.bubbleSort(ints);
		long timeAfter = System.nanoTime();
		
		System.out.println("After  : " + Arrays.toString(ints));
		System.out.println("Time Elapsed : [" + (timeAfter - timeBefore) + "] nano secondes.");
	}
}