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)

💬 Discuss

✅ Correct Answer: (D) o(2n)

Explanation: in the brute force implementation, all the possible subsets will be formed. this takes exponential time.

Published by Mr. Dubey ⭐ 111.54K Points at 16-Sep-2023 03:44 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

in the brute force implementation, all the possible subsets will be formed. this takes exponential time.

💬 Discussion

📊 Question Analytics

👁️

96

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

84%

Success Rate