Q. What will be the auxiliary space complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?

(A) o(n log n)
(B) o(n2)
(C) o(2n)
(D) o(sum*n)

💬 Discuss

✅ Correct Answer: (D) o(sum*n)

Explanation: the auxiliary space complexity of set partition problem is required in order to store the partition table. it takes up a space of n*sum, so its auxiliary space requirement becomes o(n*sum).

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

Explanation by: Mr. Dubey

the auxiliary space complexity of set partition problem is required in order to store the partition table. it takes up a space of n*sum, so its auxiliary space requirement becomes o(n*sum).

💬 Discussion

📊 Question Analytics

👁️

1026

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

80%

Success Rate

Q. What will be the auxiliary space complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?

Explanation by: Mr. Dubey

💬 Discussion

Related MCQs

📊 Question Analytics