What is the time complexity of the brute force algorithm used to solve the balanced partition problem?
|Answer» D. o(2n)|
|Explanation: in the brute force implementation, all the possible subsets will be formed. this takes exponential time.|
Login to Continue
It will take less than 2 minutes