Q1075
Which of the following is not true about set partition problem?
A.
the recursive solution has a time complexity of O(2n)
B.
there is no known solution that takes polynomial time
C.
the recursive solution is slower than dynamic programming solution
D.
the dynamic programming solution has a time complexity of O(n log n)
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board