冒泡

package test;

public class WORK {

    public static void main(String[] args) {
        // 冒泡排序
        int[] array = { 49, 38, 65, 97, 76, 13, 27, 19 };
        for (int i = 0; i < array.length; i++) {
            System.out.print(array[i] + "\t");
        }
        System.out.println();

        for (int j = 1; j < array.length - 1; j++) {
            for (int i = 0; i < array.length - j; i++) {
                if (array[i] > array[i + 1]) {
                    int t = array[i];
                    array[i] = array[i + 1];
                    array[i + 1] = t;
                }

            }

            for (int i = 0; i < array.length; i++) {
                System.out.print(array[i] + "\t");

            }
            System.out.println();
            // TODO 自动生成的方法存根

        }
    }

}