冒泡算法

  var arr = [3, 1, 5, 22, 13, 18, 66, 43, 33, 6];
    for (let index = 0; index < arr.length - 1; index++) {
        for (let index1 = 0; index1 < arr.length - 1 - index; index1++) {
            var tem = 0;
            if (arr[index1] > arr[index1 + 1]) {
                tem = arr[index1];
                arr[index1] = arr[index1 + 1];
                arr[index1 + 1] = tem
            }
        }
    }
    console.log(arr);
    // [1, 3, 5, 6, 13, 18, 22, 33, 43, 66]