js数组冒泡排序简单解析

冒泡排序就是数组一项同后一项对比，如果小，则互换

即遍历2次数组

var arr = [1,3,8,5,4,9,6,8];
console.log(sort(arr, "MIN"))
/**
 *
 * @param arr  排序数组
 * @param type  排序方式
 * @returns {Array} 排好序数组
 */
function sort(arr, type) {
    var arr_len = arr.length;
    var arr1 = [];
    arr1 = arr1.concat(arr);
    for (var i = 0; i < arr_len; i++){
        for (var j = i; j < arr_len; j++){
            var flag = arr1[i] > arr1[j];
            type = type ? type : "min";
            if (type.toLowerCase() == "max") {
                flag = arr1[i] < arr1[j]
            }
            if (flag){
                var middle = arr1[i];
                arr1[i] = arr1[j];
                arr1[j] = middle;
            }
        }
    }
    return arr1
}