冒泡排序

代码来自《Java面向对象编程》

package com.perficient.basic;

public class ArraySortor {
	public static void bubbleSort(int[] arr){
		// i=0时,从 arr[0]<arr[1] 比较到 arr[i-2]<arr[i-1]
		// i= arr.length-2,只比较arr[0]与arr[1]
		for(int i=0;i<arr.length-1;i++){
			for (int j=0;j<arr.length-1-i;j++){
				if (arr[j] > arr[j+1]){
					int temp = arr[j];
					arr[j] = arr[j+1];
					arr[j+1] = temp;				
				}
			}
		print(i+1, arr);	
			
		}
		
	}
	public static void print(int time, int[] array){
		System.out.println("第" + time + "趟排序");
		for(int i=0;i<array.length;i++){
			System.out.print(array[i] + "");
		}
		System.out.println();
		
	}
	public static void main(String[] arg){
		int[] array = {4,7,1,9,5,8};
		bubbleSort(array);

        // 使用Arrays对象的sort()方法排序 
        int[] arr2 = {5, 4, 3, 2 ,1};
		Arrays.sort(arr2);
		for(int i=0;i<arr2.length;i++){
			System.out.print(arr2[i] + " ");
		}		
	}
}