MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
What is the time complexity of the brute force algorithm used to find the longest common subsequence? |
| A. | O(n) |
| B. | O(n<sup>2</sup>) |
| C. | O(n<sup>3</sup>) |
| D. | O(2<sup>n</sup>) |
| Answer» E. | |