Catalan Number: Difference between revisions
From charlesreid1
(Created page with "Very important number series occurring in combinatorics: https://en.wikipedia.org/wiki/Catalan_number Recurrence relation: <math> C_0 = 1 </math> <math> C_{n+1} = \sum_{i=0...") |
No edit summary |
||
| Line 17: | Line 17: | ||
</math> | </math> | ||
More links: | |||
* Wikipedia link (also above): https://en.wikipedia.org/wiki/Catalan_number | |||
* geeks for geeks, focusing on programming implementations (non-recursive and recursive): http://www.geeksforgeeks.org/program-nth-catalan-number/ | |||
* interview repo on github: https://github.com/mission-peace/interview/blob/master/src/com/interview/dynamic/CountNumberOfTreesInBST.java | |||
[[Category:Numbers]] | |||
[[Category:Integer Sequence]] | |||
[[Category:Algorithms]] | |||
[[Category:CS]] | |||
[[Category:Math]] | [[Category:Math]] | ||
Revision as of 09:00, 1 July 2017
Very important number series occurring in combinatorics: https://en.wikipedia.org/wiki/Catalan_number
Recurrence relation:
$ C_0 = 1 $
$ C_{n+1} = \sum_{i=0}^{n} C_{i} C_{n-i} $
Formula:
$ C_{n} = \dfrac{(2n)!}{(n+1)! n!} $
More links:
- Wikipedia link (also above): https://en.wikipedia.org/wiki/Catalan_number
- geeks for geeks, focusing on programming implementations (non-recursive and recursive): http://www.geeksforgeeks.org/program-nth-catalan-number/
- interview repo on github: https://github.com/mission-peace/interview/blob/master/src/com/interview/dynamic/CountNumberOfTreesInBST.java