Vidyalelo
Data Structure · Q96

Miscellaneous on Data Structures

Programming · Data Structure · question 96

Q96

Which of the following is true about the time complexity of the recursive solution of the subset sum problem?

A.
It has an exponential time complexity
Answer
B.
It has a linear time complexity
C.
It has a logarithmic time complexity
D.
it has a time complexity of O(n2)

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board