冒泡排序法

package cn.test;

public class BubbleSort {
	public static void main(String[] args) {
		int[] array = { 10, 5, 6, 12, 33, 55, 2 };
		System.out.println("排序前：");
		printArray(array);
		bubbleAscSort(array);
		bubbleDescSort(array);
	}

	public static void bubbleAscSort(int[] arr) {
		int len = arr.length;
		int tmp = 0;
		for (int i = 0; i < len - 1; i++) {
			for (int j = 0; j < len - i - 1; j++) {
				if (arr[j] > arr[j + 1]) {
					tmp = arr[j];
					arr[j] = arr[j + 1];
					arr[j + 1] = tmp;
				}
			}
		}
		System.out.println("\n排序后：");
		printArray(arr);
	}
	
	public static void bubbleDescSort(int[] arr) {
		int len = arr.length;
		int tmp = 0;
		for (int i = 0; i < len - 1; i++) {
			for (int j = 0; j < len - i - 1; j++) {
				if (arr[j] < arr[j + 1]) {
					tmp = arr[j];
					arr[j] = arr[j + 1];
					arr[j + 1] = tmp;
				}
			}
		}
		System.out.println("\n排序后：");
		printArray(arr);
	}

	public static void printArray(int[] array) {
		int len = array.length;
		for (int i = 0; i < len; i++) {
			if (i == (len - 1)) {
				System.out.print(array[i]);
			} else {
				System.out.print(array[i] + ",");
			}
		}
	}
}