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 algorithms #3

Open
ektagarg opened this issue Oct 21, 2019 · 5 comments
Open

Add algorithms #3

ektagarg opened this issue Oct 21, 2019 · 5 comments
Labels
documentation Improvements or additions to documentation enhancement New feature or request good first issue Good for newcomers Hacktoberfest Resolve issue and be a part of Hacktoberfest community

Comments

@ektagarg
Copy link
Owner

ektagarg commented Oct 21, 2019 •
edited
Loading

Implement any algorithm:

  1. Huffman coding algorithm
  2. Dijkstra's algorithm
  3. Prim's algorithm [DONE]
  4. Kruskal's algorithm [DONE]
  5. Tim sort [DONE]
  6. Cocktail sort [DONE]
  7. Cycle sort [DONE]
  8. Bitonic sort [DONE]

Rules

  1. Add yourprogram.go file to the respective folder for example sort will go to Array/sort/yoursort
  2. Add yourprogram_test.go file and write all possible test cases
  3. Add Readme.md
@ektagarg ektagarg added documentation Improvements or additions to documentation enhancement New feature or request good first issue Good for newcomers Hacktoberfest Resolve issue and be a part of Hacktoberfest community labels Oct 21, 2019
@AngelsProjects
Copy link

Sounds great ill try some of those!

@gmelodie
Copy link
Contributor

gmelodie commented Oct 22, 2019 •
edited
Loading

Was thinking about implementing a trie or maybe an ADT (Abstract Data Type) for graphs, in order to make coding Prim or Kruskal easier (wouldn't need to reimplement the ADT every time.

Let me know if any of those interest you :)

@ektagarg
Copy link
Owner Author

@gmelodie sounds good, go ahead!

@gmelodie gmelodie mentioned this issue Oct 22, 2019
Merged
@nickborysov nickborysov mentioned this issue Oct 22, 2019
Merged
@malvgomes malvgomes mentioned this issue Oct 24, 2019
Closed
@smoreg smoreg mentioned this issue Oct 24, 2019
Merged
@dianashevchenko
Copy link
Contributor

Have already added, cocktail implementation. Please check @ektagarg

@nickborysov nickborysov mentioned this issue Oct 24, 2019
Merged
@dianashevchenko
Copy link
Contributor

Added Dijkstra shortest path, Please check @ektagarg

@rdrahul rdrahul mentioned this issue Oct 29, 2019
Merged
rdrahul pushed a commit to rdrahul/go-ds that referenced this issue Oct 30, 2019
kruskals Added ektagarg#3
f00d068
@rdrahul rdrahul mentioned this issue Oct 30, 2019
Merged
ektagarg added a commit that referenced this issue Oct 30, 2019
@ektagarg
Merge pull request #13 from rdrahul/master
24afd87 
kruskals Added #3
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
documentation Improvements or additions to documentation enhancement New feature or request good first issue Good for newcomers Hacktoberfest Resolve issue and be a part of Hacktoberfest community
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
4 participants
@gmelodie @ektagarg @AngelsProjects @dianashevchenko