站长资源网络编程

js二维数组排序的简单示例代码

整理:jimmy2026/8/6浏览2
简介如下所示:复制代码 代码如下: New Docume</div> <div class="news_infos"><div id="MyContent"><P><STRONG>如下所示:<BR></STRONG><U>复制代码</U> 代码如下:<BR><!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"><BR><html><BR> <head><BR>  <title> New Document </title><BR>  <meta name="Generator" content="EditPlus"><BR>  <meta name="Author" content=""><BR>  <meta name="Keywords" content=""><BR>  <meta name="Description" content=""><BR>  <script type="text/javascript"><BR>  <!--<br><br> function getCard(m){<BR>  var ret = [], rnd; <BR>  for(var i = 0; i < m; i++){<BR>   rnd = Math.floor(Math.random()*(i+0.9999));<BR>   ret[i] = ret[rnd];<BR>   ret[rnd] = i<BR>  }<BR>  return ret;<BR> }<br><br> var data = [];<BR> {<BR>  for(var i = 0; i < 100; i ++){<BR>   data.push(getCard(10));<BR>  }<BR> }<BR> // 二维数据排序<BR> function mySort(array, col, ord, b, e){<BR>  if(array.length == 0) return;<BR>  //document.write("排序前"+array);<BR>  var t = [], s, i, curCol = col[0];<BR>  for(i = b; i < e; i ++){<BR>   s = new String(array[i][curCol]);<BR>   s._obj = array[i];<BR>   t.push(s)<BR>  }<BR>  t.sort();<BR>  if(ord[0] == "des"){<BR>   t.reverse();<BR>  }<BR>  for(i = 0; i < e - b; i++){<BR>   //document.write("<br/>");<BR>   //document.write(array[i]);<BR>   //document.write("<br/>");<BR>   //document.write(t[i]._obj);<BR>   //document.write("<br/>");<BR>   //document.write(t[i]._obj == array[b+i]);<BR>   array[b+i] = t[i]._obj;<BR>  }<BR>  //document.write("排序后====================<br/>")<BR>  //print(array);<BR>  var begin, end;<BR>  if(col.length > 1){<BR>   col.shift();<BR>   ord.shift();<BR>   begin = b;<BR>   for(i = b; i < e - b - 1; i++){<BR>    if( array[i][curCol] != array[i+1][curCol] ){<BR>     end = i+1;<BR>     //document.write("begin="+begin+"end="+end+"<br/>");<BR>     mySort(array,col,ord,begin,end);<BR>     begin = end;<BR>    }<BR>   }<BR>   if(begin != e){<BR>    mySort(array,col,ord,begin,e);<BR>   }<BR>  }</P> <P>  //document.write("<br/>");<BR>  //document.write("排序后"+array);<BR> }<BR> function print(data){<BR>  for(var i = 0; i < data.length; i++){<BR>   document.write(data[i]+"<br/>");<BR>  }<BR> }<BR> document.write("排序前====================<br/>");<BR> print(data);<BR> var b = new Date().getTime();;<BR> mySort(data, [0,1,2],['asc','des','asc'],0,data.length); <BR> document.write("用时"+(new Date().getTime() - b));<BR> document.write("排序后====================<br/>")<BR> print(data);<BR>  //--><BR>  </script><BR> </head></P> <P> <body><br><br> </body><BR></html><BR></P></div> </div> </div> <div class="share"> </div> <div class="nextinfo"> <p>上一篇:<a href="/3g/1/119840.html" title="js sort 二维数组排序的用法小结">js sort 二维数组排序的用法小结</a></p> <p>下一篇:<a href="/3g/1/119842.html" title="js中数组(Array)的排序(sort)注意事项说明">js中数组(Array)的排序(sort)注意事项说明</a></p> </div> <div class="otherlink"> <h2>最新资源</h2> <ul> <li><a href="/3g/1/623703.html" title="群星《奔赴!万人现场 第2期》[FLAC/分轨]">群星《奔赴!万人现场 第2期》[FLAC/分轨]</a></li> <li><a href="/3g/1/623702.html" title="群星《奇妙浪一夏 (上海迪士尼度假区音乐">群星《奇妙浪一夏 (上海迪士尼度假区音乐</a></li> <li><a href="/3g/1/623701.html" title="群星《奇妙浪一夏 (上海迪士尼度假区音乐">群星《奇妙浪一夏 (上海迪士尼度假区音乐</a></li> <li><a href="/3g/1/623700.html" title="【古典音乐】詹姆斯·高威《季节》1993[WA">【古典音乐】詹姆斯·高威《季节》1993[WA</a></li> <li><a href="/3g/1/623699.html" title="贝拉芳蒂《卡里普索之王》SACD[WAV+CUE]">贝拉芳蒂《卡里普索之王》SACD[WAV+CUE]</a></li> <li><a href="/3g/1/623698.html" title="小骆驼-《草原狼2(蓝光CD)》[原抓WAV+CUE">小骆驼-《草原狼2(蓝光CD)》[原抓WAV+CUE</a></li> <li><a href="/3g/1/623697.html" title="群星《欢迎来到我身边 电影原声专辑》[32">群星《欢迎来到我身边 电影原声专辑》[32</a></li> <li><a href="/3g/1/623696.html" title="群星《欢迎来到我身边 电影原声专辑》[FL">群星《欢迎来到我身边 电影原声专辑》[FL</a></li> <li><a href="/3g/1/623695.html" title="雷婷《梦里蓝天HQⅡ》 2023头版限量编号低">雷婷《梦里蓝天HQⅡ》 2023头版限量编号低</a></li> <li><a href="/3g/1/623694.html" title="群星《2024好听新歌42》AI调整音效【WAV分">群星《2024好听新歌42》AI调整音效【WAV分</a></li> </ul> </div> </div> <div class="sidebar"> <div class="cloud"><h2 class="hometitle">一句话新闻</h2><a href="/3G/1/604673.html"><ul>高通与谷歌联手!首款骁龙PC优化Chrome浏览器发布<br><br>高通和谷歌日前宣布,推出首次面向搭载骁龙的Windows PC的优化版Chrome浏览器。<br>在对骁龙X Elite参考设计的初步测试中,全新的Chrome浏览器在Speedometer 2.1基准测试中实现了显著的性能提升。<br>预计在2024年年中之前,搭载骁龙X Elite计算平台的PC将面世。该浏览器的提前问世,有助于骁龙PC问世就获得满血表现。<br>谷歌高级副总裁Hiroshi Lockheimer表示,此次与高通的合作将有助于确保Chrome用户在当前ARM兼容的PC上获得最佳的浏览体验。</ul></a></div> <div class="cloud"><h2 class="hometitle">标签云</h2><ul><a href="/search.asp?key=1080P高清&m=1">1080P高清<span>(5)</span></a><a href="/search.asp?key=高清电影&m=1">高清电影<span>(5)</span></a><a href="/search.asp?key=百度云盘&m=1">百度云盘<span>(5)</span></a><a href="/search.asp?key=网盘下载&m=1">网盘下载<span>(4)</span></a><a href="/search.asp?key=破解软件&m=1">破解软件<span>(4)</span></a><a href="/search.asp?key=绿色软件&m=1">绿色软件<span>(4)</span></a><a href="/search.asp?key=磁力链接&m=1">磁力链接<span>(3)</span></a><a href="/search.asp?key=强度天梯&m=1">强度天梯<span>(3)</span></a><a href="/search.asp?key=福利资源&m=1">福利资源<span>(2)</span></a><a href="/search.asp?key=王者荣耀&m=1">王者荣耀<span>(2)</span></a><a href="/search.asp?key=黑钻活动&m=1">黑钻活动<span>(2)</span></a><a href="/search.asp?key=WPS会员&m=1">WPS会员<span>(2)</span></a><a href="/search.asp?key=刷图排行&m=1">刷图排行<span>(1)</span></a><a href="/search.asp?key=网盘限速&m=1">网盘限速<span>(1)</span></a><a href="/search.asp?key=鬼灭之刃&m=1">鬼灭之刃<span>(1)</span></a><a href="/search.asp?key=免费韩国漫画&m=1">免费韩国漫画<span>(1)</span></a><a href="/search.asp?key=宫本重做&m=1">宫本重做<span>(1)</span></a><a href="/search.asp?key=免费动漫&m=1">免费动漫<span>(1)</span></a></ul></div> </div> <div class="sidebar"> 友情链接:<a href="http://www.imxmx.com/" title="杰晶网络" target="_blank">杰晶网络</a> <a href="/" title="DDR爱好者之家" target="_blank">DDR爱好者之家</a> <a href="http://www.nqxw.com/" title="南强小屋" target="_blank">南强小屋</a> <a href="http://www.paidiu.com/" title="黑松山资源网" target="_blank">黑松山资源网</a> <a href="http://www.dyhadc.com/" title="白云城资源网" target="_blank">白云城资源网</a> <a href="/sitemap1.xml">站点地图</a> <a href="/sitemap.xml">SiteMap</a> </div> </article> <footer> <p>Design by <a href="http://m.ddrfans.com">DDR爱好者之家</a> <a href="http://m.ddrfans.com">http://m.ddrfans.com</a></p> </footer> <script src="/images3g/nav.js"></script> <script type="text/javascript"> jQuery.noConflict(); jQuery(function() { var elm = jQuery('#left_flow2'); var startPos = jQuery(elm).offset().top; jQuery.event.add(window, "scroll", function() { var p = jQuery(window).scrollTop(); jQuery(elm).css('position', ((p) > startPos) ? 'fixed' : ''); jQuery(elm).css('top', ((p) > startPos) ? '0' : ''); }); }); </script> </body> </html>