MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
In the brute force implementation to find the longest increasing subsequence, all the subsequences of a given sequence are found. All the increasing subsequences are then selected and the length of the longest subsequence is found. What is the time complexity of this brute force implementation? |
| A. | O(n) |
| B. | O(n<sup>2</sup>) |
| C. | O(n!) |
| D. | O(2<sup>n</sup>) |
| Answer» E. | |