冒泡——选择排序

1 冒泡排序

    var mao=[33,3,5,8,12,22,73];
    for(var j=mao.length-1;j>0;j--){
//循环数组长度减一次
    for (var i=0;i<j;i++){
//外循环每执行一次，内循环少循环一次
        var a=mao[i];
        if(mao[i]>mao[i+1]){
            mao[i]=mao[i+1];
            mao[i+1]=a;
        }

    }
    }
    console.log(mao);

2.选择排序

    ```
        var xuan=[5,15,6,9,11,1,12];
        var a;
        for (j=0;j<xuan.length-1;j++) {
            for (var i = j + 1; i < xuan.length; i++) {
                if (xuan[j] > xuan[i]) {
                    a = xuan[j];
                    xuan[j] = xuan[i];
                    xuan[i] = a;
                }
            }
        }
        console.log(xuan);
        ```