This repository contains implementations of various data structures and algorithms in C++. The goal is to provide a clear and concise understanding of how these fundamental concepts work.
Data structures and algorithms are essential for solving complex problems efficiently. This repository aims to serve as a resource for students, educators, and software developers looking to enhance their understanding of these concepts. This project is maintained by Aditya Pradhan and contributors.
- C++
This section includes implementations of common data structures such as:
- Arrays
- Linked Lists
- Stacks
- Queues
- Trees
- Graphs
- Hash Tables
This section includes various algorithms categorized by type:
- Sorting Algorithms (e.g., Quick Sort, Merge Sort)
- Searching Algorithms (e.g., Binary Search)
- Dynamic Programming
- Greedy Algorithms
- Backtracking Algorithms
Contributions are welcome! Please follow these steps to contribute:
- Fork the repository.
- Create a new branch (
git checkout -b feature/YourFeature
). - Make your changes.
- Commit your changes (
git commit -m 'Add some feature'
). - Push to the branch (
git push origin feature/YourFeature
). - Open a pull request.
This project is licensed under the MIT License - see the LICENSE file for details.