冒泡排序

copy code and run.

    var i,j,k;
    var level=[1,3,2,5,456,23,23,4,2334,9,23,3,42,34];
    
    for (k = 0; k < level.length; k++)
    {
        for (j = 0; j <= k; j++) 
        {
            i=k-j;
            if (level[i] < level[i + 1])
            {
          //不使用第三变量对两个数据进行交换-》只适用于数值类型 level[i]
= level[i + 1] + level[i]; level[i + 1] = level[i] - level[i + 1]; level[i] = level[i] - level[i + 1]; } } } console.log(level);

 

posted @ 2019-01-14 11:41  蓝蝠-水晶之恋  阅读(70)  评论(0编辑  收藏  举报