ObjectiveMcq
Print Protected
This page is protected for print. Use the website to view the content.
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?
Correct Answer: D — Dynamic programming, Recursion, Brute force
All of the mentioned methods can be used to solve the balanced partition problem.