算法分析与设计考试样卷.docVIP

算法分析与设计复习题 1.Based on what we have discussed in class, state the best asymptotic running time for each of the problems below, using the ”big Oh” notation. It is assumed that T(1) =d for some constant din all the recurrences. If you think the problem is NP-complete, state so (no running time should be given in this case). Just state the answers- you do not need to justify them. 2. Describe the main ideas of the following strategies, and briefly describe the differences between them. (1) divide-and–conquer; (2) dynamic programming； During the course we have studied some important classes of a