This repository contains implementations of various data structures and algorithms in multiple programming languages. The purpose of this project is to provide a comprehensive collection of fundamental computer science concepts and their practical implementations.
.
├── python/ # Python implementations
├── javascript/ # JavaScript implementations
└── README.md # Project documentation
- Python
- JavaScript
- Arrays
- Linked Lists
- Stacks
- Queues
- Trees
- Graphs
- Hash Tables
- Heaps
- Arrays
- Linked Lists
- Stacks
- Queues
- Trees
- Graphs
- Hash Tables
- Heaps
- Sorting Algorithms
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Heap Sort
- Searching Algorithms
- Linear Search
- Binary Search
- Graph Algorithms
- Depth-First Search (DFS)
- Breadth-First Search (BFS)
- Dijkstra's Algorithm
- Kruskal's Algorithm
- Prim's Algorithm
- Sorting Algorithms
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Heap Sort
- Searching Algorithms
- Linear Search
- Binary Search
- Graph Algorithms
- Depth-First Search (DFS)
- Breadth-First Search (BFS)
- Dijkstra's Algorithm
- Kruskal's Algorithm
- Prim's Algorithm
- Python 3.x
- Node.js (for JavaScript implementations)
cd python
python <filename>.pycd javascript
node <filename>.jsFeel free to contribute to this project by:
- Forking the repository
- Creating a new branch for your feature
- Committing your changes
- Pushing to the branch
- Creating a Pull Request
This project is licensed under the MIT License - see the LICENSE file for details.