冒泡排序的思路更進一步的優化

var arr = [,,,,,,,];
    console.log(arr);
    for (var j = ; j < arr.length - ; j++) {
        var flag = ;
        tang++;
        for (var i = ; i < arr.length -  - j; i++) {
            ci++;
            var temp;
            if (arr[ i ] > arr[i + ]) {
                flag++;
                temp = arr[i];
                arr[ i ] = arr[i + ];
                arr[i + ] = temp;
            }
        }
        if (flag == ) {
            break;
        }
    }