冒泡 选择 插入排序

        /*冒泡排序*/
        var arr = [112,45,7,69,32,1];
        var tmp = 0;
        for(var i=0;i<arr.length-1;i++){
            for(var j=0;j<arr.length-1-i;j++){
                if(arr[j]>arr[j+1]){
                    tmp = arr[j];
                    arr[j] = arr[j+1];
                    arr[j+1] = tmp;
                }
            }
        }
        console.log(arr);

        /*选择排序*/
        arr = [112,45,7,69,32,1];
        tmp = 0;
        for(var i=0;i<arr.length;i++){
            for(var j=i+1;j<arr.length;j++){
                if(arr[i]>arr[j]){
                    tmp = arr[j];
                    arr[j] = arr[i];
                    arr[i] = tmp;
                }
            }
        }
        console.log(arr);

        /*插入排序*/
        arr = [112,45,7,69,32,1];
        tmp = 0;
        for(var i=1;i<arr.length;i++){
            var j=i;
            while(j>0 && arr[j] < arr[j-1]){
                tmp = arr[j];
                arr[j] = arr[j-1];
                arr[j-1] = tmp;
                j--;
            }
        }
        console.log(arr);