A comprehensive collection of Data Structures and Algorithms implementations with detailed explanations.
This repository contains my implementation and learning journey of various Data Structures and Algorithms. Each implementation comes with detailed explanations and examples to help others learn and understand these fundamental concepts in computer science.
-
Linear Data Structures
- Arrays
- Linked Lists
- Stacks
- Queues
-
Non-Linear Data Structures
- Trees
- Graphs
- Hash Tables
- Heaps
-
Sorting
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Heap Sort
-
Searching
- Linear Search
- Binary Search
- Depth-First Search
- Breadth-First Search
-
Graph Algorithms
- Dijkstra's Algorithm
- Kruskal's Algorithm
- Prim's Algorithm
-
Clone the repository
git clone https://github.com/spowrrr/DSA-lab.git
-
Navigate to the specific implementation you're interested in
-
Each implementation includes:
- Source code
- Explanation of the concept
- Time and space complexity analysis
- Example usage
Contributions are what make the open source community such an amazing place to learn, inspire, and create. Any contributions you make are greatly appreciated.
- Fork the Project
- Create your Feature Branch (
git checkout -b feature/AmazingFeature) - Commit your Changes (
git commit -m 'Add some AmazingFeature') - Push to the Branch (
git push origin feature/AmazingFeature) - Open a Pull Request
This project is licensed under the MIT License - see the LICENSE file for details.
⭐ Star this repository if you find it helpful! ⭐
Created with ❤️ by spowrrr