Which of the following is true about the time complexity of...

Home / Data Structure / Miscellaneous On Data Structures / Question

Examveda

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)

Answer: Option A

Related Questions on Miscellaneous on Data Structures

A. Array

B. Linked List

C. Stack

D. Queue

View Answer

A. For implementing a stack-based algorithm

B. To maintain a balanced binary tree

C. For efficient sorting of elements

D. To test membership in a large dataset

View Answer

A. Queue

B. Stack

C. Heap

D. Array

View Answer

A. Array

B. Hash Map

C. Trie

D. Array

View Answer