西安电子科技大学算法试题答案.pdfVIP

试题答案 A 卷 西安电子科技大学计算机学院霍红卫 Problem 1. (20 points) Solution: (a) Line 3 is executed n(n-1) times on any input of length n. Thus, the worst-case running time for BUBBLE-SORT is Θ(n2) since there are 6 lines and each line is executed at most n(n-1) times. (b) Line 3 is also executed n(n-1) times in the best case, since it is executed this many times on any input of length n. Thus, the best-case running time