冒泡排序算法java实现

package algorithm;
/**
 * 冒泡排序算法
 * @author su
 *
 */
public class BubbleSort {
	
	public static void main(String[] args) {
		int[] a = {6,2,5,4,7,1,3,9,8};
		//bubbleSort(a, a.length);
		bubbleSort2(a);
		for (int i = 0; i < a.length; i++) {
			System.out.println(a[i]);
		}
	}
	/**
	 * 冒泡排序的单趟排序过程
	 * @param a  数组a
	 * @param n  数组的长度n
	 */
	private static void bubble(int[] a, int n){
		for (int i = 0; i < n-1; i++) {
			if(a[i] > a[i+1]){
				int temp = a[i];
				a[i] = a[i+1];
				a[i+1] = temp;
			}
		}
	}
	
	private static void bubbleSort(int[] a, int n){
		for (int i = n; i>=1; i--) {
			bubble(a, i);		
		}
		
	}
	
	
	private static void bubbleSort2(int[] a){
		for(int i = 1; i < a.length; i++){
			for(int j = 0; j < a.length - i; j++){
				if(a[j] > a[j+1]){
					int temp = a[j];
					a[j] = a[j+1];
					a[j+1] = temp;
				}
			}
		}
	}

}