 |
JavaScript快速排序_技術百科
[Ctrl+A 全選 註:如需引入外部Js需刷新才能執行]再你多快,你快不過Array.prototype.sort var a=[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()); 這才是最快的加個二叉樹 ...
wiki.gimoo.net |
 |