Q.

Given an array, check if the array can be divided into two subsets such that the sum of elements of the two subsets is equal. This is the balanced partition problem. Which of the following methods can be used to solve the balanced partition problem?

A. dynamic programming
B. recursion
C. brute force
D. dynamic programming, recursion, brute force
Answer» D. dynamic programming, recursion, brute force
Explanation: all of the mentioned methods can be used to solve the balanced partition
820
0
Do you find this helpful?
7

Discussion

No comments yet

Related MCQs