 
			 
			MCQOPTIONS
 Saved Bookmarks
				| 1. | What is the worst case time complexity of dynamic programming solution of set partition problem(sum=sum of set elements)? | 
| A. | O(n) | 
| B. | O(sum) | 
| C. | O(n2) | 
| D. | O(sum*n) | 
| Answer» E. | |