Overview
The goal of this project is to have in a single place all possible algorithms and data structures - in multiple languages. We aim to achieve this in a collaborative manner, so feel free to contribute in any way you want, just make sure to follow the contribution guidelines listed below.
Contents
Our content is divided by programming language. Please create an issue if you wish to add code in a language that we don't currently have here.
Contributing Guidelines
A good step-by-step is described below. There are two possible situations:
- One, in which you are submitting code for a non-existing DS/Algo. In this case, you can just follow the process below.
- In case you want to submit an improvement to an existing algo, we prefer that you create an issue, describing in details your improvement. This will help others to analyze your contribution. You can use the templates that we have provided :)
Make sure your code works before submitting it :D
- Fork it (https://github.com/tesseractcoding/neoalgo/fork)
- Create your branch SEE BELOW MORE INFORMATION (git checkout -b fooBar)
- Commit your changes (git commit -am 'Add some fooBar')
- Push to the branch (git push origin fooBar)
- Create a new Pull Request
Where to upload the files
PLEASE READ THIS
- Your files should be uploaded directly into the language folder (e.g. if you wrote code for python, within the Python folder and so on)
- Edit the corresponding README.md file to add the link to your code in the corresponding section (GitHub Markdown Guide)
- Under no circumstances create new folders within the language folders to upload your code.
- Also, be polite with the reviewers - they will be ALWAYS polite to you.
Code of Conduct
add code of conduct here
License
This project follows the MIT License.
Contributors ✨
Thanks goes to these wonderful people (emoji key):
Syed Farhan Ahmad 🖋 📖 |
Harsh Bardhan Mishra 🖋 📖 |
Ricardo Prins 🖋 📖 |
Swaraj Rajpure 💻 |
Ashwani Singh 💻 |
Aman Priyanshu 💻 |
Lucas Castro 💻 |
This project follows the all-contributors specification. Contributions of any kind are welcome!