冒泡排序

import java.util.Arrays;

public class test7 {
    /**
     * 
     * @param arr
     */
    public static void bubbleSort(int[] arr) {
        for (int i = 0; i < arr.length-1; i++) {
            //length-1表示下标在0--length-1
            for (int j = 0; j < arr.length-1-i; j++) {
                //下标j<length-i表示有i个数已经沉入底部，不用在做比较
                if(arr[j] > arr[j+1]) {
                    int tmp = arr[j];
                    arr[j] = arr[j+1];
                    arr[j+1] = tmp;
                }
            }
        }
    }
    public static void main(String[] args) {
        int[] array = {1,22,4,14,2};
        bubbleSort(array);
        System.out.println(Arrays.toString(array));
    }
}