冒泡排序——Java

这里仅做一个小备忘，博主后面会有系统的算法体系文章，这篇未来会被舍弃

public class Test2 {
    public static void main(String[] args) {
        int[] arrs = {1, 68, 746, 44, 12, 3, 68};

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

//                    int temp = arrs[j+1];
//                    arrs[j+1] = arrs[j];
//                    arrs[j] = temp;

                    arrs[j + 1] = arrs[j] ^ arrs[j + 1];
                    arrs[j] = arrs[j + 1] ^ arrs[j];
                    arrs[j + 1] = arrs[j + 1] ^ arrs[j];

                }
            }
        }
        for (int arr : arrs) {
            System.out.println(arr);
        }
    }
}