排序-冒泡-java

public class Test {
    public static void main(String[] args) {
        int[] arr = {5, 2, 6, 8, 9, 1};
        if (arr == null || arr.length <= 2) {
            return;
        }
        for (int end = arr.length - 1; end > 0; end--) {
            for (int i = 0; i < end; i++) {
                //冒泡排序的实质就是数组下标 (0,1) (1,2) (2,3)...这样两两进行判断
                if (arr[i] > arr[i + 1]) {
                    swap(arr, i, i + 1);
                }
            }
        }
        for (int i = 0; i < arr.length; i++) {
            System.out.println(arr[i]);
        }
    }

    private static void swap(int[] arr, int i, int j) {
        arr[i] = arr[i] ^ arr[j];
        arr[j] = arr[i] ^ arr[j];
        arr[i] = arr[i] ^ arr[j];
    }
}