js 二维数组根据列的和，对列进行排序。冒泡排序

排序前：

 

排序后：

 

        for (let i = 1; i < source.length - 1; i++) {
            for (let j = 1; j < source.length - 1 - i; j++) {
                let sum = 0;
                for (let k = 1; k < source.length; k++) {
                    sum += source[k][j]
                }
                let sum1 = 0;
                for (let k = 1; k < source.length; k++) {
                    sum1 += source[k][j + 1]
                }
                if (sum < sum1) {
                    for (let k = 1; k < source.length; k++) {
                        let t;
                        t = source[k][j];
                        source[k][j] = source[k][j + 1];
                        source[k][j + 1] = t;
                    }
                }
            }
        }