Discuss
/
JavaScript
/
冒泡排序
冒泡排序
Topic source
为什么这样也能通过
var i,list=document.getElementById("test-list"); var len=list.children.length-1 for(i=0;i<len;i++){ if(list.children[i].innerText>list.children[i+1].innerText){ var lib=list.children[i]; var lia=list.children[i+1]; list.insertBefore(lia,lib); } }
- 1
谏山__黄泉
// sort list: var i,j; var list = document.getElementById('test-list'); for(i=0;i<list.children.length;i++){ for(j=0;j<list.children.length-1-i;j++){ if(list.children[j].innerText>list.children[j+1].innerText){ var lis = list.children[j]; var lii = list.children[j+1]; list.insertBefore(lii,lis); } } }