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.

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

Linked sample algorithm #2

Merged
merged 3 commits into from
Dec 2, 2019
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
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
1 change: 0 additions & 1 deletion Algorithms

This file was deleted.

File renamed without changes.
3 changes: 3 additions & 0 deletions README.md
Original file line number Diff line number Diff line change
@@ -1,2 +1,5 @@
# nwoc_algorithms
This is a library of various algorithms that are used in competitive programming.

### sample algorithm
[disjoint_set_union.cpp](Algorithms/disjoint_set_union/disjoint_set_union.cpp)
2 changes: 1 addition & 1 deletion instructions.md
Original file line number Diff line number Diff line change
Expand Up @@ -22,7 +22,7 @@ Before contributing, check whether the algorithm has already been implemented or

1. Make a folder for your algorithm. The folder name should be descriptive. Use underscores instead of spaces.
2. Put your program in that folder. Keep the program name as similar as possible to the folder name.
3. Add documentation for your program.Algorithms without a basic documentation (description, input/output format, sample input/output) will **not** be accepted.
3. Add documentation for your program.Algorithms without a basic documentation (description, input/output format, sample input/output) will **not** be accepted. See [disjoint_set_union.cpp](Algorithms/disjoint_set_union/disjoint_set_union.cpp) for example.
4. Update the List of Algorithms in [README](README.md) with your algorithm.
5. Commit and push the changes, then submit a Pull Request.

Expand Down