Which of the following implementations of Catalan numbers has the smallest time complexity?
(a) Dynamic programming
(b) Binomial coefficients
(c) Recursion
(d) All have equal time complexity
This question was posed to me in unit test.
My question is from Catalan Number using Dynamic Programming in section Dynamic Programming of Data Structures & Algorithms II