算法设计与分析作业答案.pdfVIP

CS330: Introduction To Algorithm Spring 2014 Lecture 2: Asymptotic Analysis TF: Xianrui Meng Scribes: Raman Bahdanouski, Ellie Vial Exercise 1 Suppose you have algorithms with the five running times listed below.How much slower do each of these algorithms get when you (a) double the input size, or (b) increase the input size by one? 1. n2 ; 2. n3 ; 3. 100n2 ; 4. nlog (n); 5. 2n ; Solu