算法设计与分析试题2（Algorithm design and analysis item 2）.doc

算法设计与分析试题2（Algorithm design and analysis item 2） 1. (1) proof: O (f) + O (g) = O (f + g) (7 points) (2) the asymptotic expression of the following functions: (6 points) 3 n2 + 10 n; 21 + 1 / n. (1) to prove: the F (N) = O (F), there are natural number N1, C1, for any natural number N, are: F (N)....................................... .. (2 points) Similarly can make G (N) = O (G), there are natural number N2, C2, for any natural number N, are: G (N)....................................... .. (3) For C3 = Max {C1, C2}, N3 = Max {N1, N2}, then all N is: F (N) G (N)....................................... .. (5 points) Therefore, are: O (f) (g) = f + O (N) + g (N) Thus there are: O (f) + O (g) = O (f + g)................................. .. (7) The definition of asymptotic expression is easy to understand: Asymptotic expression. ....................................... .. (3) Because: the definition of asymptotic expression is easy to know: 21 is the asymptotic expression of 21 plus 1 over n. ....................................... .. (6) 3. Try the divide-and-conquer algorithm to quickly sort the array A [n]. (13) Solution: the algorithm code to be solved by divide and conquer is as follows: Int partition (float A [], int p, int r) { Int I = p, j = r + 1; Float x = a, [p]. While (1) { While (a [+ + I) x); While (a [- j] x); If (I = j) break; A [I]....................................... .. (4) }; A [p] = a, [j]. A [j] = x; Return j; ....................................... .. (7) } Void Quicksort (float a [], int p, int r) { If (p r) { Int q = partition (a, p, r); ....................................... .. (10) Quicksort (1 a, p, q); Quicksort (a, q + 1, r); } }; A, Quicksort (0, n - 1); ....................................... .. (13) 4. Try the dynamic programming algorithm to realize the longest common subsequence problem. (15 points) Solution: the algorithm code solved by the dynamic programming algorithm is as follows: Int lcs_len (char * a, char * b, int c [N]) {