03 2012 档案

算法笔记(1) ——插入算法
摘要：var ary = [5, 2, 4, 6, 1, 3,31,4,0,1,43];function InsertionSort(){ for (var j = 1; j < ary.length; j++) { var key = ary[j]; var i = j - 1; while(i >= 0 && ary[i] > key){ ary[i + 1] = ary[i]; i--; } ary[i + 1] = key; };} 阅读全文
posted @ 2012-03-17 19:58 Miser 阅读(217) 评论(0) 推荐(0)