冒泡排序方法

     // 冒泡排序:

     var arr = [3,4,5,7,1,2,8,13,35,7,9];

    //   console.log(arr.sort((a,b)=>a-b)); 

     // console.log(arr.sort(function(a,b){return a-b})); 

     // 轮数->两两比较的次数

     // 从小到大排列

     // 轮次

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

        // 两两比较的次数

        for(var j=0;j<arr.length-i;j++){

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

                       // 左边的值大于右边 

                       var temp = arr[j];

                       arr[j] = arr[j+1]

                       arr[j+1] = temp

                }

        }



        console.log("第"+i+"轮排序的结果是:"+arr)



      }

      console.log("-----")

      console.log(arr)



     //如何交换两个变量的值?

     //var a =1;

     //var b=2;

     //var c;

      // c=a; // c=1

      // a=b //  a=2;

      // b=c;  //b=1



     console.log(a,b) //2 1

猜你喜欢

转载自blog.csdn.net/emm_10_01/article/details/122012904