Q.

What is the time complexity of the brute force algorithm used to solve the balanced partition problem?

A. o(1)
B. o(n)
C. o(n2)
D. o(2n)
Answer» D. o(2n)
Explanation: in the brute force implementation, all the possible subsets will be formed. this takes exponential time.
2.8k
0
Do you find this helpful?
24

Discussion

No comments yet

Related MCQs