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

Add gitter badge #159

Closed
sangamcse opened this issue Oct 2, 2018 · 1 comment
Closed

Add gitter badge #159

sangamcse opened this issue Oct 2, 2018 · 1 comment
Assignees
@sangamcse
Labels
documentation

Comments

@sangamcse
Copy link
Member

Add Gitter badge in README
@sangamcse sangamcse self-assigned this Oct 2, 2018
sangamcse added a commit to sangamcse/Algorithms that referenced this issue Oct 2, 2018
@sangamcse
README: Add gitter badge
56bf654 
Add community communication channel.

Closes NITSkmOS#159
@sangamcse
Copy link
Member Author

GitMate.io thinks possibly related issues are #2 (Add all sorting algorithms), #3 (Add extended euclidean-gcd algo), #21 ([Algo]: Add Heapsort in Java), #156 (Add Git Basic Tutorial for newcomer), and #23 ([Algo]: Add Heapsort in C).

@sangamcse sangamcse mentioned this issue Oct 2, 2018
Merged
sangamcse added a commit that referenced this issue Oct 2, 2018
@sangamcse
README: Add gitter badge
1136931 
Add community communication channel.

Closes #159
thekaleidoscope added a commit to thekaleidoscope/Algorithms that referenced this issue Oct 2, 2018
@thekaleidoscope
extended_euclidean_gcd.py: Add Extended Euclidean GCD Algorithm
a01486b 
This adds Extended Euclidean Algorithm with Python implementation of the same.
This implementation uses iterative method of the algorithm, takes two
values and gives out the gcd along with the polynomial equation to get
inverse directly if the gcd is 1. Code uses generic notations and
naming standard used in documentation along with that found in Wikipedia.

Closes NITSkmOS#3 NITSkmOS#159
thekaleidoscope added a commit to thekaleidoscope/Algorithms that referenced this issue Oct 2, 2018
@thekaleidoscope
extended_euclidean_gcd.py: Add Extended Euclidean GCD Algorithm
7bec1c1 
This adds Extended Euclidean Algorithm with Python implementation of the same.
This implementation uses iterative method of the algorithm, takes two
values and gives out the gcd along with the polynomial equation to get
inverse directly if the gcd is 1. Code uses generic notations and
naming standard used in documentation along with that found in Wikipedia.

Closes NITSkmOS#3 NITSkmOS#159
@thekaleidoscope thekaleidoscope mentioned this issue Oct 2, 2018
Merged
7 tasks
sangamcse pushed a commit to thekaleidoscope/Algorithms that referenced this issue Oct 2, 2018
@thekaleidoscope @gitmate-bot
extended_euclidean_gcd.py: Add Extended Euclidean GCD Algorithm
7c3f89c 
This adds Extended Euclidean Algorithm with Python implementation of the same.
This implementation uses iterative method of the algorithm, takes two
values and gives out the gcd along with the polynomial equation to get
inverse directly if the gcd is 1. Code uses generic notations and
naming standard used in documentation along with that found in Wikipedia.

Closes NITSkmOS#3 NITSkmOS#159
@sangamcse sangamcse mentioned this issue Oct 4, 2018
Closed
@sangamcse sangamcse mentioned this issue Oct 29, 2018
Closed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@sangamcse sangamcse

Labels
documentation
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@sangamcse