|
4A: Precisely describe a faster algorithm (running in time O(n m)) for computing MCS(A, n, B, m). Describe the algorithm with the lowest big-O worst-case running time that you can. |
|
4A: Precisely describe a faster algorithm (running in time O(n m)) for computing MCS(A, n, B, m). |
|
Include a print-out of your algorithm and the length of the shared subsequence that it finds. |
|
Include a print-out of your algorithm and the length of the shared subsequence that it finds. |