摘要:
希尔排序思路我们在第 i 次时取gap = n/(2的i次方),然后将数组分为gap组(从下标0开始,每相邻的gap个元素为一组),接下来我们对每一组进行直接插入排序。希尔排序实现Function.prototype.method = function(name, func){ this.prototype[name] = func; return this;};Array.method('shellSort', function(){ var len = this.length, gap = parseInt(len/2), i, j, tmp; wh... 阅读全文
posted @ 2013-10-09 00:12
JChen___
阅读(148)
评论(0)
推荐(0)