[Ctrl+A 全选 注:如需引入外部Js需刷新才能执行]

复制代码 代码如下:

再你多快，你快不过Array.prototype.sort

vara=[4,723,3,5,67,32,4,43,34,545,43,43,,234,7,367,7,87,23,6,78,7957,t,84,78,34,536,2345,4534566,67,67,54,45,797,67,8798,76543,8];

alert(a.sort());

这才是最快的

加个二叉树排序

function node(data){ this.data = data; var Lnode; var Rnode; this.insert = function insert(newData){ if(newData