Vidyalelo
Data Structure · Q265

Miscellaneous on Data Structures

Programming · Data Structure · question 265

Q265

Which of the following is the time complexity of finding nth Catalan numbers using binomial coefficient?

A.
O(n)
Answer
B.
O(n2)
C.
O(1)
D.
O(log n2)

Answer: Option A

Solution

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