By Noxxxx from https://www.noxxxx.com/?post_type=post&p=521
欢迎分享与聚合，尊重版权，可以联系授权

冒泡排序

平均时间复杂度 O(n2)  空间复杂度 O(1)

function bubbleSort(arr) {
    var i = arr.length;
    var position = 0;
    var tmp = 0;
    while (i>0) {
        position = 0;
        for(var j = 0;j<i;j++) {
            if(arr[j]> arr[j+1]) {
                position = j;
                tmp = arr[j];
                arr[j] = arr[j+1];
                arr[j+1] = tmp;
            }
        }
        i = position;
    }
    return arr;
}