1

Which of the following is not true about subset sum problem?

Correct Answer: the dynamic programming solution has a time complexity of o(n log n)

Make the most of this question

This page focuses on one Design and Analysis of Algorithms question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.

Design and Analysis of Algorithms MCQ: Which of the following is not true about subset sum problem? | Extra Education