首页 > Web开发 > 详细

20151005js3

时间:2015-10-14 14:09:30      阅读:429      评论:0      收藏:0      [点我收藏+]

循环嵌套 :99乘法表示例

技术分享

    var s = "";
    s += "<table>";

    for (var i = 1; i < 10; i++) {
        s += "<tr>";
        for (var j = 1; j <= i; j++) {

            s += "<td>" + i + "*" + j + "=" + i * j + "</td>";
        }
        s += "</tr>";
    }
    s += "</table>";
    document.getElementById("dcon").innerHTML = s;

选择排序示例

技术分享

 var iNum = [34, 19, 11, 109, 3, 56];
        var temp=0;
        for (var i = 0; i <= iNum.length-2; i++) {
for (var j = i + 1; j <=iNum.length - 1; j++) { if (iNum[i] > iNum[j]) { temp = iNum[j]; iNum[j] = iNum[i]; iNum[i] = temp; } } } for (var a = 0; a < iNum.length; a++) { document.write(iNum[a] + "<br/>"); }

 冒泡排序示例

技术分享

var iNum = [34, 19, 11, 109, 3, 56];
        var temp=0;
        for (var i = 0; i <= iNum.length-2; i++) {//-2 小于等于等同于小于-1
            for (var j =0; j <=iNum.length-1-i; j++) {//-1为了避免下标越界,-x为了让外循环增加一次,内循环参数与比较的元素个数递减
                if (iNum[j] > iNum[j+1]) {
                    temp = iNum[j];
                    iNum[j] = iNum[j+1];
                    iNum[j+1] = temp;
                }
            }
        }
        for (var a = 0; a < iNum.length; a++) {
  
            document.write(iNum[a] + "<br/>");
        }

 

20151005js3

原文:http://www.cnblogs.com/16lily521/p/4877160.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!