Discuss / JavaScript / 简单排序
Back

简单排序

Topic source

还在园子里的狸狸

#1 Created at ... [Delete] [Delete and Lock User] 
var l = document.getElementById('test-list');
if(l){
    if(l.children.length>1){
        for(var i = 0;i <l.children.length; i ++){
            var m = 0;
            for(var j = 1; j < l.children.length -i; j ++){
                if(l.children[j].innerText < l.children[m].innerText)
                    m = j;
            }
            l.appendChild(l.children[m]);
        }

    }
}

新故式每天去实验室

#2 Created at ... [Delete] [Delete and Lock User]

var list = document.getElementById('test-list'); var i, j, ct, ct1, c; for(i=0; i< list.children.length; ++i){ ct = list.children[0].innerText; c = list.children[0]; for(j=1;j<list.children.length-i; ++j){ ct1 = list.children[j].innerText; if(ct > ct1){ ct = ct1; c=list.children[j] } }

 list.appendChild(c);

} 一直翻评论，看到你了

  • 1

Reply