MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
| 1. |
What is the worst case time complexity of dynamic programming solution of the subset sum problem(sum=given subset sum)? |
| A. | O(n) |
| B. | O(sum) |
| C. | O(n<sup>2</sup>) |
| D. | O(sum*n) |
| Answer» E. | |