二、冒泡排序

package bubbling;

/**
 * 冒泡排序
 *
 * @author zy 刘会发
 * @since 2020/4/9
 */
public class Bubbling {

    public static void ari() {
        int a[] = new int[]{5, 2, 7, 6, 3, 8, 9, 10, 20, 13, 15, 11};
        for (int i = 0; i < a.length; i++) {
            for (int j = i + 1; j < a.length; j++) {
                if (a[i] > a[j]) {
                    exchange(a, i, j);//交换
                }
            }
        }
        for (int i = 0; i < a.length; i++) {
            System.out.print(a[i] + ",");
        }
    }

    static void exchange(int[] a, int i, int j) {
        int temp = a[i];
        a[i] = a[j];
        a[j] = temp;
    }

    public static void main(String[] args) {
        ari();
    }
}