Welcome to the Algorithms and Data Structures repository! This repository contains implementations of various algorithms and data structures commonly used in computer science and software engineering.
This repository is a collection of algorithms and data structures implemented in different programming languages. It is designed for:
- Students learning algorithms and data structures.
- Developers preparing for coding interviews.
- Enthusiasts looking to improve problem-solving skills.
- Clear and well-commented code for ease of understanding.
- Multiple languages support (e.g., C++, Python, Java).
- Algorithms categorized by type (e.g., sorting, searching, graph algorithms).
- Standard data structures implemented with examples.
- Merge Sort
- Quick Sort
- Heap Sort
- Binary Search
- Depth-First Search (DFS)
- Breadth-First Search (BFS)
- Dijkstra's Algorithm
- Prim's Algorithm
- Bellman-Ford Algorithm
- Dynamic Programming
- Fibonacci Sequence
- Longest Common Subsequence
- Greedy Algorithms
- Arrays
- Linked Lists
- Singly Linked List
- Doubly Linked List
- Stacks and Queues
- Trees
- Binary Search Tree
- Heap
- Graphs
- Adjacency List
- Adjacency Matrix
-
Clone the repository:
git clone https://github.com/elitekbtu/ads_materials.git
-
Navigate to the desired folder to explore the implementation.
-
Compile and run the code using your preferred compiler or interpreter.
Example for C++:
g++ filename.cpp -o output ./output
Contributions are welcome! If you want to add an algorithm, improve existing code, or fix issues:
-
Fork the repository.
-
Create a new branch:
git checkout -b feature-name
-
Commit your changes and push the branch:
git commit -m "Description of changes" git push origin feature-name
-
Open a pull request.
This repository is licensed under the MIT License. See the LICENSE file for details.
Happy Coding! 🎉