2011年9月5日
chapter 2.getting started
摘要： 2-1 Insertion sort on small arrays in merge sortAlthough merge sort runs in(n lg n) worst-case time and insertion sort runsin(n^2) worst-case time, the constant factors in insertion sort make it faster forsmall n. Thus, it makes sense to use insertion sort within merge sort when subprob-lems become 阅读全文
posted @ 2011-09-05 08:47 Mose 阅读(275) 评论(0) 推荐(0)