Skip to content

Adding javascript and c to euclidean algorithm #5

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.

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

Merged
merged 1 commit into from
Sep 16, 2017
Merged

Adding javascript and c to euclidean algorithm #5

merged 1 commit into from
Sep 16, 2017

Conversation

Gathros
Copy link
Contributor

@Gathros Gathros commented Sep 16, 2017

why did you remove euclid_rec

@leios leios merged commit 766c1a5 into algorithm-archivists:master Sep 16, 2017
@leios
Copy link
Member

leios commented Sep 16, 2017

  1. Thanks! That was quick!
  2. I debated leaving the recursive method in, but I decided against it because it was just the mod-based method. I guess I should have left it in.

@Gathros
Copy link
Contributor Author

Gathros commented Sep 16, 2017

Oh ok and I made it in the live stream.

@leios
Copy link
Member

leios commented Sep 16, 2017

Haha, fair enough! Thanks so much for submitting / the support! You rock!

Gathros pushed a commit that referenced this pull request Aug 4, 2018
Adding `dfs_recursive_inorder_btree` to rust
june128 added a commit that referenced this pull request Nov 16, 2018
This is a combination of 5 commits.
This is the 1st commit message:

Add Tree Traversal in Emojicode

This is the commit message #2:

Remove unnecessary 🤜🤛.

This was suggested by thbwd:
"No need to wrap 🤜children_count🤛 into 🤜🤛actually."
(https://github.com/algorithm-archivists/algorithm-archive/pull/
471#discussion_r223291032)

This is the commit message #3:

Extract shared logic into a method.

This was suggested by thbwd:
"This is shared logic. I’d recommend you extract it into a method."
(https://github.com/algorithm-archivists/algorithm-archive/pull/
471#discussion_r223291140)

This is the commit message #4:

Use documentation comments.

This was suggested by thbwd:
"Shouldn’t these be documentation comments? https://www.emojicode.org/
docs/reference/documentation.html"
(https://github.com/algorithm-archivists/algorithm-archive/pull/
471#discussion_r223291281)

This is the commit message #5:

Add error as a potential return value for DFS RI Binary

To be able to return an error and to apply suggestion by thbwd
(https://github.com/algorithm-archivists/algorithm-archive/pull/
471#discussion_r223597592) the following changes were made:
- Declare an enum to hold the error value.
- Rewrite the Depth-First Search Recursive Inorder Binary method to
return an optional holding the enum and adjust the returns according
to that.
- Call the rewritten method and check, if the returned optional holds
error. If it does: Print out the error message defined in the enum.

Signed-off-by: Julian Schacher <[email protected]>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants