You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: Competitive Coding/Math/Catalan_Numbers/README.md
+4-4Lines changed: 4 additions & 4 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -5,13 +5,13 @@ They're similar to Fibonacci (very slightly)
5
5
The two different implementations vary only in terms of time taken!<br>
6
6
Basically we can implement in 3 different ways!<br>
7
7
8
-
* Recursively - Exponential time complexity<br>
9
-
* Dynamic Programming - O(n^2)<br>
10
-
* Binomial Coefficient - O(n) <br><br>
8
+
* Recursively - `Exponential time complexity`<br>
9
+
* Dynamic Programming - `O(n^2)`<br>
10
+
* Binomial Coefficient - `O(n)` <br><br>
11
11
12
12
Each of the above 3 implementations have a descending order of time complexities from (1) to (3) <br><br>
13
13
14
14
The Binomial implementation has the best time complexity while the Recursive implementation has the worst time complexity<br>
15
15
In this folder we have the Binomial and Recursive implementations of Catalan Numbers.<br><br>
16
16
17
-
Sources : https://www.geeksforgeeks.org/program-nth-catalan-number/ (You can have a look at this to know more about Catalan number implementations and its theory.)
17
+
Sources : Click [here](https://www.geeksforgeeks.org/program-nth-catalan-number/)to know more about Catalan number implementations and its theory.
0 commit comments