What is the time complexity of the brute force algorithm used to solve the balanced partition problem?
What is the time complexity of the brute force algorithm used to solve the balanced partition problem? Correct Answer O(2n)
In the brute force implementation, all the possible subsets will be formed. This takes exponential time.
মোঃ আরিফুল ইসলাম
Feb 20, 2025