javascript冒泡排序

wanghui 發(fā)布于2019-08-26 12:10 / 2154人閱讀

摘要：冒泡排序可謂是最經(jīng)典的排序算法了，它是基于比較的排序算法，其優(yōu)點(diǎn)是實(shí)現(xiàn)簡單，排序數(shù)量較小時(shí)性能較好。也可以實(shí)現(xiàn)大數(shù)放在前面，小數(shù)放在后面，如果前面的數(shù)據(jù)比后面的小，就交換兩個(gè)的位置。要實(shí)現(xiàn)上述規(guī)則需要用到兩層循環(huán)。

冒泡排序可謂是最經(jīng)典的排序算法了，它是基于比較的排序算法，其優(yōu)點(diǎn)是實(shí)現(xiàn)簡單，排序數(shù)量較小時(shí)性能較好。

算法原理

相鄰的數(shù)據(jù)進(jìn)行兩兩比較，小數(shù)放在前面，大數(shù)放在后面，如果前面的數(shù)據(jù)比后面的數(shù)據(jù)大，就交換這兩個(gè)數(shù)的位置。也可以實(shí)現(xiàn)大數(shù)放在前面，小數(shù)放在后面，如果前面的數(shù)據(jù)比后面的小，就交換兩個(gè)的位置。要實(shí)現(xiàn)上述規(guī)則需要用到兩層for循環(huán)。

代碼實(shí)現(xiàn)

冒泡實(shí)現(xiàn)數(shù)組從小到大排序

var arr=[2,7,1,8,6,4,3,5,9];
function mintomax(par){
  var length=par.length;
  for(var i=0; ipar[j+1]){
        var temp=par[j+1];
        par[j+1]=par[j];
        par[j]=temp;
      }
    }
  }
  return par;
}
console.log(mintomax(arr));

冒泡實(shí)現(xiàn)數(shù)組從大到小排序

var arr=[2,7,1,8,6,4,3,5,9];
function maxtomin(par){
      var length=par.length;
      for(var i=0; i
用es6結(jié)構(gòu)賦值的方式重寫上面代碼
var arr=[2,7,1,8,6,4,3,5,9];
function mintomax(par){
  var length=par.length;
  for(var i=0; ipar[j+1]){
        [par[j],par[j+1]]=[par[j+1],par[j]]
      }
    }
  }
  return par;
}
console.log(mintomax(arr));
function maxtomin(par){
  var length=par.length;
  for(var i=0; i
按照父子平鋪順序排序
var data = [{
  ZDXM_STDCODE: "100101",
  ZDXM_STDNAME: "",
  FINA_YYSR: "",
  FINA_PGZHSY: "",
  FINA_SJZHSY: "",
  FINA_PGZHSYL: "",
  FINA_SJZHSYL: "",
  FINA_ZHSYLCE: "",
  FINA_SRJJL: "",
  FINA_JSSKL: "",
  FINA_HTE: "",
  GLZDXM: "1001",
},
{
  ZDXM_STDCODE: "1001",
  ZDXM_STDNAME: "",
  FINA_YYSR: "",
  FINA_PGZHSY: "",
  FINA_SJZHSY: "",
  FINA_PGZHSYL: "",
  FINA_SJZHSYL: "",
  FINA_ZHSYLCE: "",
  FINA_SRJJL: "",
  FINA_JSSKL: "",
  FINA_HTE: "",
  GLZDXM: "",
},
{
  ZDXM_STDCODE: "100102",
  ZDXM_STDNAME: "",
  FINA_YYSR: "",
  FINA_PGZHSY: "",
  FINA_SJZHSY: "",
  FINA_PGZHSYL: "",
  FINA_SJZHSYL: "",
  FINA_ZHSYLCE: "",
  FINA_SRJJL: "",
  FINA_JSSKL: "",
  FINA_HTE: "",
  GLZDXM: "1001",
},
{
  ZDXM_STDCODE: "100201",
  ZDXM_STDNAME: "",
  FINA_YYSR: "",
  FINA_PGZHSY: "",
  FINA_SJZHSY: "",
  FINA_PGZHSYL: "",
  FINA_SJZHSYL: "",
  FINA_ZHSYLCE: "",
  FINA_SRJJL: "",
  FINA_JSSKL: "",
  FINA_HTE: "",
  GLZDXM: "1002",
},
{
  ZDXM_STDCODE: "1002",
  ZDXM_STDNAME: "",
  FINA_YYSR: "",
  FINA_PGZHSY: "",
  FINA_SJZHSY: "",
  FINA_PGZHSYL: "",
  FINA_SJZHSYL: "",
  FINA_ZHSYLCE: "",
  FINA_SRJJL: "",
  FINA_JSSKL: "",
  FINA_HTE: "",
  GLZDXM: "",
},
{
  ZDXM_STDCODE: "100202",
  ZDXM_STDNAME: "",
  FINA_YYSR: "",
  FINA_PGZHSY: "",
  FINA_SJZHSY: "",
  FINA_PGZHSYL: "",
  FINA_SJZHSYL: "",
  FINA_ZHSYLCE: "",
  FINA_SRJJL: "",
  FINA_JSSKL: "",
  FINA_HTE: "",
  GLZDXM: "1002",
},
]
function datatotree(par) {
  var length = par.length;
  for (var i = 0; i < length-1; i++) {
    for (var j = 0; j < length - i - 1; j++) {
      var str1=par[j].GLZDXM+par[j].ZDXM_STDCODE;
      var str2=par[j+1].GLZDXM+par[j+1].ZDXM_STDCODE;
      if(par[j].GLZDXM==null){
        str1=par[j].ZDXM_STDCODE;
      }
      if(data[j+1].GLZDXM==null){
        str2=par[j+1].ZDXM_STDCODE;
      }
      if (str1 > str2) {
        var temp = par[j + 1];
        par[j + 1] = par[j]
        par[j] = temp;
      }
    }
  }
  return par;
}
var data = datatotree(data)
console.log(data);
按照es6結(jié)構(gòu)賦值重寫上面代碼
var data = [{
  ZDXM_STDCODE: "100101",
  ZDXM_STDNAME: "",
  FINA_YYSR: "",
  FINA_PGZHSY: "",
  FINA_SJZHSY: "",
  FINA_PGZHSYL: "",
  FINA_SJZHSYL: "",
  FINA_ZHSYLCE: "",
  FINA_SRJJL: "",
  FINA_JSSKL: "",
  FINA_HTE: "",
  GLZDXM: "1001",
},
{
  ZDXM_STDCODE: "1001",
  ZDXM_STDNAME: "",
  FINA_YYSR: "",
  FINA_PGZHSY: "",
  FINA_SJZHSY: "",
  FINA_PGZHSYL: "",
  FINA_SJZHSYL: "",
  FINA_ZHSYLCE: "",
  FINA_SRJJL: "",
  FINA_JSSKL: "",
  FINA_HTE: "",
  GLZDXM: "",
},
{
  ZDXM_STDCODE: "100102",
  ZDXM_STDNAME: "",
  FINA_YYSR: "",
  FINA_PGZHSY: "",
  FINA_SJZHSY: "",
  FINA_PGZHSYL: "",
  FINA_SJZHSYL: "",
  FINA_ZHSYLCE: "",
  FINA_SRJJL: "",
  FINA_JSSKL: "",
  FINA_HTE: "",
  GLZDXM: "1001",
},
{
  ZDXM_STDCODE: "100201",
  ZDXM_STDNAME: "",
  FINA_YYSR: "",
  FINA_PGZHSY: "",
  FINA_SJZHSY: "",
  FINA_PGZHSYL: "",
  FINA_SJZHSYL: "",
  FINA_ZHSYLCE: "",
  FINA_SRJJL: "",
  FINA_JSSKL: "",
  FINA_HTE: "",
  GLZDXM: "1002",
},
{
  ZDXM_STDCODE: "1002",
  ZDXM_STDNAME: "",
  FINA_YYSR: "",
  FINA_PGZHSY: "",
  FINA_SJZHSY: "",
  FINA_PGZHSYL: "",
  FINA_SJZHSYL: "",
  FINA_ZHSYLCE: "",
  FINA_SRJJL: "",
  FINA_JSSKL: "",
  FINA_HTE: "",
  GLZDXM: "",
},
{
  ZDXM_STDCODE: "100202",
  ZDXM_STDNAME: "",
  FINA_YYSR: "",
  FINA_PGZHSY: "",
  FINA_SJZHSY: "",
  FINA_PGZHSYL: "",
  FINA_SJZHSYL: "",
  FINA_ZHSYLCE: "",
  FINA_SRJJL: "",
  FINA_JSSKL: "",
  FINA_HTE: "",
  GLZDXM: "1002",
},
]
function datatotree(par) {
  var length = par.length;
  for (var i = 0; i < length-1; i++) {
    for (var j = 0; j < length - i - 1; j++) {
      var str1=par[j].GLZDXM+par[j].ZDXM_STDCODE;
      var str2=par[j+1].GLZDXM+par[j+1].ZDXM_STDCODE;
      if(par[j].GLZDXM==null){
        str1=par[j].ZDXM_STDCODE;
      }
      if(data[j+1].GLZDXM==null){
        str2=par[j+1].ZDXM_STDCODE;
      }
      if (str1 > str2) {
        [par[j],par[j+1]]=[par[j+1],par[j]];
      }
    }
  }
  return par;
}
var data = datatotree(data)
console.log(data);
上面代碼排序之后結(jié)果

GPU云服務(wù)器云服務(wù)器冒泡排序前端冒泡排序冒泡排序代碼 js冒泡排序

文章版權(quán)歸作者所有，未經(jīng)允許請勿轉(zhuǎn)載,若此文章存在違規(guī)行為，您可以聯(lián)系管理員刪除。

轉(zhuǎn)載請注明本文地址：http://systransis.cn/yun/108155.html

發(fā)表評論

登陸后可評論

0條評論

wanghui

男|高級講師

我要關(guān)注我要私信

TA的文章

代理模式C++實(shí)現(xiàn)

閱讀 1947·2021-11-25 09:43
Hadoop 入門筆記—核心組件 YARN

閱讀 1441·2021-11-22 14:56
【C++】list詳解

閱讀 3306·2021-11-22 09:34
Python爬蟲案例50篇-第8篇- 抓取某訊招聘的北京工作崗位

閱讀 2050·2021-11-15 11:37
WPTao淘寶客插件配置淘寶聯(lián)盟和京東聯(lián)盟API信息

閱讀 2324·2021-09-01 10:46
react知識點(diǎn)整理50問（未完待續(xù)）

閱讀 1428·2019-08-30 15:44
CSS背景與邊框

閱讀 2323·2019-08-30 13:15
使用原生js實(shí)現(xiàn)輪播圖效果

閱讀 2418·2019-08-29 13:07

JavaScript 數(shù)據(jù)結(jié)構(gòu)與算法之美 - 冒泡排序、插入排序、選擇排序

JavaScript實(shí)現(xiàn)冒泡排序可視化

JavaScript實(shí)現(xiàn)冒泡排序

Javascript實(shí)現(xiàn)冒泡排序與快速排序以及對快速排序的性能優(yōu)化

JavaScript排序，不只是冒泡

javascript 算法整理

成人国产在线小视频_日韩寡妇人妻调教在线播放_色成人www永久在线观看_2018国产精品久久_亚洲欧美高清在线30p_亚洲少妇综合一区_黄色在线播放国产_亚洲另类技巧小说校园_国产主播xx日韩_a级毛片在线免费

資訊專欄INFORMATION COLUMN

上云采購季！| 2核2G4M爆款云服務(wù)器低至59元/年，更有多臺、長期優(yōu)惠，快來選購！

javascript冒泡排序

相關(guān)文章

發(fā)表評論

0條評論

wanghui

男|高級講師

TA的文章

代理模式C++實(shí)現(xiàn)

Hadoop 入門筆記—核心組件 YARN

【C++】list詳解

Python爬蟲案例50篇-第8篇- 抓取某訊招聘的北京工作崗位

WPTao淘寶客插件配置淘寶聯(lián)盟和京東聯(lián)盟API信息

react知識點(diǎn)整理50問（未完待續(xù)）

CSS背景與邊框

使用原生js實(shí)現(xiàn)輪播圖效果

最新活動(dòng)

資訊專欄INFORMATION COLUMN

上云采購季！| 2核2G4M爆款云服務(wù)器低至59元/年，更有多臺、長期優(yōu)惠，快來選購！

javascript冒泡排序

相關(guān)文章

發(fā)表評論

0條評論

男|高級講師

TA的文章

最新活動(dòng)

上云采購季！| 2核2G4M爆款云服務(wù)器低至59元/年，更有多臺、長期優(yōu)惠，快來選購！