Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Added 2 different implementations for Catalan Numbers #255

Merged
merged 9 commits into from
Dec 31, 2017
Merged

Added 2 different implementations for Catalan Numbers #255

Changes from 1 commit
Commits
Show all changes
9 commits
Select commit Hold shift + click to select a range
24f5deb
Added 2 different implementations for Catalan Numbers
rahulkumaran Dec 25, 2017
c29e3a9
Update catalan_binomial.py
rahulkumaran Dec 25, 2017
ef9b750
Create README.md
rahulkumaran Dec 25, 2017
ad8540e
Update README.md
rahulkumaran Dec 28, 2017
70fb09c
Update README.md
rahulkumaran Dec 29, 2017
9a1fc8c
Update README.md
rahulkumaran Dec 29, 2017
e63ac07
Update catalan_binomial.py
rahulkumaran Dec 29, 2017
e3cac9d
Update catalan_recursive.py
rahulkumaran Dec 29, 2017
099e891
Update README.md
rahulkumaran Dec 29, 2017
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
10 changes: 3 additions & 7 deletions Competitive Coding/Math/Catalan_Numbers/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,16 +5,12 @@ They're similar to Fibonacci (very slightly)
The 2 different implementations vary only in terms of time taken!<br>
Basically we can implement in 3 different ways!<br>

(1) Recursively <br>
(2) Dynamic Programming <br>
(3) Binomial Coefficient <br><br>
* Recursively - Exponential time complexity<br>
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

make use of tilde

like this O(n^2)

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

done

* Dynamic Programming - O(n^2)<br>
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

make a tilde before and after O(n^2)

* Binomial Coefficient - O(n) <br><br>

Each of the above 3 implementations have a descending order of time complexities from (1) to (3) <br><br>

For (1) the time complexity is exponential<br>
For (2) the time complexity is O(n^2)<br>
For (3) the time complexity is O(n)<br><br>

The Binomial implementation has the best time complexity while the Recursive implementation has the worst time complexity<br>
In this folder we have the Binomial and Recursive implementations of Catalan Numbers.<br><br>

Expand Down