A

Admin • 833K Points
Coach

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)

Explanation by: Admin

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).

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.