FilesExpand file tree

 master

/

desc.json

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

19 lines (19 loc) · 1.46 KB

 master

/

desc.json

Copy path

Top

File metadata and controls

• Code
• Blame

19 lines (19 loc) · 1.46 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

{

"Catalan Number": " In combinatorial mathematics, the Catalan numbers form a sequence of natural numbers that occur in various counting problems, often involving recursively-defined objects.The Catalan numbers on nonnegative integers n are a set of numbers that arise in tree enumeration problems of the type, 'In how many ways can a regular n-gon be divided into n-2 triangles if different orientations are counted separately?' (Euler's polygon division problem).",

"Applications": [

"The number of ways to stack coins on a bottom row that consists of n consecutive coins in a plane, such that no coins are allowed to be put on the two sides of the bottom coins and every additional coin must be above two other coins, is the nth Catalan number",

"The number of ways to group a string of n pairs of parentheses, such that each open parenthesis has a matching closed parenthesis, is the nth Catalan number",

"The number of ways to cut an n+2-sided convex polygon in a plane into triangles by connecting vertices with straight, non-intersecting lines is the nth Catalan number. This is the application in which Euler was interested."

],

"Complexity": {

"time": " $O(N^2)$",

"space": "$O(N)$"

},

"References": [

"<a href='https://en.wikipedia.org/wiki/Catalan_number'>Wikipedia</a>",

"<a href='http://oldweb.sbc.edu/sites/default/files/Honors/XiaotongJiang.July20_0.pdf'>Sweet Briar College"

],

"files": {

"catalan_number": "Catalan Number"

}

}