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
(b) It has a linear time complexity
(c) It has a logarithmic time complexity
(d) it has a time complexity of O(n2)
The question was posed to me in examination.
The query is from Checksum, Complexity Classes & NP Complete Problems topic in division Checksum, Complexity Classes & NP Complete Problems of Data Structures & Algorithms II