js冒泡排序20200417

var arr1=[1,3,2,4,5,7,4,8],temp=0;
for(var i=0;i<=arr1.length-1;i++)//每个数需要交换的趟数
{
    for(var j=0;j<=arr1.length-i-1;j++)//每一趟需要交换的次数
    {
        if(arr1[j]<arr1[j+1])
        {
            temp=arr1[j+1];
            arr1[j+1]=arr1[j];
            arr1[j]=temp;
        }
    }
}
console.log(arr1);