This repository is a part of HacktoberFest -an event organised by DigitalOcean. You are requested to create your profile using the above link to be a part of it.
This repository contains examples of various algorithms written on different programming languages...
| Algorithm | C | CPP | Java | Python | JavaScript |
|---|---|---|---|---|---|
| Euclidean GCD | |||||
| QuickSort | |||||
| Merge Sort | |||||
| Insertion Sort | |||||
| Counting Sort | |||||
| Tower of Hanoi |
| Data Structure | C | CPP | Java | Python | JavaScript |
|---|---|---|---|---|---|
| Queue | |||||
| Stack |
| Language | Steps |
|---|---|
| Python | python [filename.py] |
| C | gcc [filename.c] |
| CPP | g++ [filename.cpp] |
| Java | javac [filename.java] |
| golang | go build [filename.go] |
| Algorithm | C | CPP | Java | Python | JavaScript |
|---|---|---|---|---|---|
| Pre-Order Traversal | [:octocat:] | ||||
| Post-Order Traversal | [:octocat:] | ||||
| In-Order Traversal | [:octocat:] | ||||
| Binary Search Tree | [:octocat:] | [:octocat:] | |||
| Height of the Tree | |||||
| Depth of the Tree | |||||
| AVL Tree | |||||
| Spanning Tree |
-
Fork it!
-
Clone the forked repository to local system.
-
Create your feature branch:
git checkout -b my-new-feature -
Commit your changes:
git commit -am 'Add some feature'.Go through Commit Messages guidelines
-
Push to the branch:
git push origin my-new-feature -
Submit a pull request 😄
See Contributor.md.
Feel free to contact us at our E-mail, we'd be happy to help!
Only project maintainers should merge a PR. Other members can add their reviews to a PR but the merging should be done by only a project maintainer.
