1.

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)
Answer» E.


Discussion

No Comment Found

Related MCQs