js数组排序常用的几种方法

var arr1=[10,90,55,43,23,8,79];

var arr2=[9,88,67,24,39,74,28];

    //把数组循环

    //sort方法

    var sum1=0;

    for(var i=0;i<arr1.length;i++){

    sum1+=arr1[i]

    }

    console.log(sum1);  

        var sum2=0;      

        var sum2=0;

        for(var j=0;j<arr2.length;j++){ 

            sum2+=arr2[i];

        }

        // console.log(sum2)

        if(sum1>sum2){

            console.log("arr1最大");

        }else{

            console.log("arr2最大")

            }

            arr2.sort(function(a,b){

                return a-b

            })

            console.log(arr2);

            //选择排序

        function selectSort(arr2){

            for(var i=0;i<arr2.length;i++){

                var min=arr2[i];

                var minIndex=i;

                for(var j=i+1;j<arr2.length;j++){

                    if(min>arr2[j])

                    min=arr2[j]

                    minIndex=j;

                }

            }

            arr2.splice(i,0,min);

            arr2.splice(minIndex+1,1)

        }

        selectSort(arr2);       

       console.log(arr2);

       //原生js数组排序

        function order(arr2){

        var len=arr2.length;

        var max=0; 

        var num=0; 

         for(var i=len-1;i>0;i--){

        max=arr2[0];

        for(var j=0;j<=i;j++){

            if(max<=arr2[j]){ 

                max=arr2[j]; 

                num=j;

            }

        }

        mid=arr2[i]; 

        arr2[num]=mid;

        arr2[i]=max; 

        }

        return arr2;

        }

        console.log(arr2);

 

//冒泡排序

    for(var i=0;i<=arr2.length-1;i++){

            for(var j=1;j<=arr2.length-1-i;j++){

                if(arr2[j]>arr2[j+1]){

                    var temp=arr2[j];  

                    arr2[j]=arr2[j+1];

                    arr2[j+1]=temp;

                }

            }

            

    }

    // document.write(arr2)

    console.log(arr2)

    //插入排序

    var len=arr2.length;

    var preIndex,current;

    for(var i=1;i<len;i++){

        preIndex=i-1;

        current=arr2[i];

        while(preIndex>=0 &&arr2[preIndex]>current){

                arr2[preIndex+1]=arr2[preIndex];

         

                preIndex--;

                arr[preIndex+1]=current;       

            }

            return arr2;

                            function inser(arr){

                                var len=arr.length;

                                if(len<=1){

                                    return arr;

                                }

                                for(var i=1; i<=len;i++){

                                    for(var j=i-1; j>=0;j--){

                                        if(arr[j]>arr[j+1]);

                                        var temp=arr[j];

                                        arr[j]=arr[j+1];

                                        arrr[j]=temp;

                                    }

                                }

                            }

                            }