算法导论习题-1.2-2
题目Suppose we are comparing implementations of insertion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n28n^2 steps, while merge sort runs in 64nlgn64nlgn steps.
原创
2015-06-08 23:20:47 ·
946 阅读 ·
1 评论