冒泡排序

    let arr1 = [3, 4, 2, 1, 2, 4, 5, 7, 6];    
    let temp = null;    
    for (let i = 1; i < arr1.length; i++) { 
        for (j = 0; j < arr1.length - i; j++) {
            if (arr1[j] > arr1[j + 1]) {          
            temp = arr1[j];          
            arr1[j] = arr1[j + 1];          
            arr1[j + 1] = temp;        
            }      
        }    
    }    
    console.log(arr1);    

    let arr2 = [3, 4, 2, 1, 2, 4, 5, 7, 6];    
    let arr3 = [arr2[0]];    
    for (let m = 1; m < arr2.length; m++) {      
        for (let n = 0; n < arr3.length; n++) {        
            if (arr2[m] <= arr3[n]) {          
               arr3.splice(n, 0, arr2[m]);          
               break;        
            }        
            if (n == (arr3.length-1)) {          
                arr3.push(arr2[m]);          
                break;        
            }      
        }    
    }    
    console.log(arr3);