1.

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(n<sup>2</sup>)
D. O(2<sup>n</sup>)
Answer» E.


Discussion

No Comment Found

Related MCQs