java选择排序

代码：

package com.wangyq.datastructrue.sort;

import java.util.Arrays;

public class Bubbling {
    public static void main(String[] args) {
        int[] ints = {0,34, 7, 834, 75, 23, 345, 78908, 2, 3};
        System.out.println("排序前：" + Arrays.toString(ints));
        bubbling(ints);
        System.out.println("排序后：" + Arrays.toString(ints));

    }

    private static void bubbling(int[] ints) {
        //临时变量，存储上一个的值
        int temp = 0;
        //记录此次有没有循环过
        boolean flag = true;
        for (int i = 0; i < ints.length - 1; i++) {
            //记录第一个的值
            temp = ints[0];
            //最后的值已经是最大的，不在循环
            for (int j = 1; j < ints.length - i; j++) {
                if (temp > ints[j]) {
                    ints[j - 1] = ints[j];
                    ints[j] = temp;
                    flag = false;
                }
                temp = ints[j];
            }
            //如果没有循环过取消再冒泡
            if (flag) {
                break;
            }
            flag = true;
            System.out.println("第" + (i + 1) + "次排序：" + Arrays.toString(ints));

        }
    }

}

结果：
排序前：[0, 34, 7, 834, 75, 23, 345, 78908, 2, 3]
第1次排序：[0, 34, 7, 834, 75, 23, 345, 78908, 2, 3]
第2次排序：[0, 2, 7, 834, 75, 23, 345, 78908, 34, 3]
第3次排序：[0, 2, 3, 834, 75, 23, 345, 78908, 34, 7]
第4次排序：[0, 2, 3, 7, 75, 23, 345, 78908, 34, 834]
第5次排序：[0, 2, 3, 7, 23, 75, 345, 78908, 34, 834]
第6次排序：[0, 2, 3, 7, 23, 34, 345, 78908, 75, 834]
第7次排序：[0, 2, 3, 7, 23, 34, 75, 78908, 345, 834]
第8次排序：[0, 2, 3, 7, 23, 34, 75, 345, 78908, 834]
第9次排序：[0, 2, 3, 7, 23, 34, 75, 345, 834, 78908]
排序后：[0, 2, 3, 7, 23, 34, 75, 345, 834, 78908]