Q71
Which of the following implementations of Catalan numbers has the smallest time complexity?
A.
Dynamic programming
B.
Binomial coefficients
AnswerC.
Recursion
D.
All have equal time complexity
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board