摘要:
Exercises 2.2-4 How can we modify almost any algorithm to have a good best-case running time? CHEAT. Is there any OIer who can not cheat? That's O(1). 2.3-6 Can we use a binary search instead to impr... 阅读全文
posted @ 2007-12-24 21:02
Fancy Mouse
阅读(520)
评论(0)
推荐(0)
浙公网安备 33010602011771号