Data-Structures-and-Algorithms

Sample implementations of data structures and algorithms in any programming language.

Implementation

Every single data structures or algorithms are implemented in a separate directory.
We can run any of the implemented algorithms using the program run.py.

Implement the algorithm in a separate directory.
Using Makefile is optional.
There must be a shell script named 'run.sh' which contains commands to build and execute the algorithm. However it is done is the implementor's concern, but it should successfully execute the code. See 'run.sh' of the directory 'Singly Linked List' to have a taste of it.
Next step is to enter the exact name of the directory which contains the algorithm in the file 'ROOT/Register' in a separate line. Otherwise, 'run.py' will fail to detect your implementation.
Run 'run.py'.
If all OK, then the algorithm will run as expected.

Linux: Just run the python script 'run.py' from the shell.
Windows: It is recommended to install git-bash and run the script 'run.py'. Windows batch scripts are not implemented yet.

Name		Name	Last commit message	Last commit date
Latest commit History 34 Commits
AVL Tree		AVL Tree
BFS		BFS
Basic Graph		Basic Graph
Binary Search Tree		Binary Search Tree
DFS		DFS
Dijkstra's Shortest Path Algorithm		Dijkstra's Shortest Path Algorithm
Heap		Heap
Linked_list_golang		Linked_list_golang
Queue		Queue
Red-Black Tree		Red-Black Tree
Singly Linked List		Singly Linked List
.gitignore		.gitignore
BUGS		BUGS
README.md		README.md
Register		Register
TODO.txt		TODO.txt
regression-test.sh		regression-test.sh
run.py		run.py