Welcome to my Data Structures and Algorithms repository, where I implement and explore various algorithms and data structures in C++. This repository is designed to provide a comprehensive collection of algorithms and data structures, along with their time and space complexities, to help developers and students learn and practice.
- Data Structures
- Algorithms
- Time Complexity: O(1) for access, O(n) for search
- Space Complexity: O(n)
- Time Complexity: O(n) for search, O(n) for manipulation
- Space Complexity: O(n)
- Time Complexity: O(n) for search, O(1) for insertion/deletion
- Space Complexity: O(n)
- Time Complexity: O(1) for push/pop, O(n) for search
- Space Complexity: O(n)
- Time Complexity: O(1) for enqueue/dequeue, O(n) for search
- Space Complexity: O(n)
- Time Complexity: O(log n) for search, O(n) for insertion/deletion
- Space Complexity: O(n)
- Applications: Database indexing, File systems, Compilers
- Example: File system hierarchy
- Time Complexity: O(log n) for search, O(n) for insertion/deletion
- Space Complexity: O(n)
- Applications: Heap data structure, Priority queues, Scheduling algorithms
- Example: Heap data structure
- Time Complexity: O(log n) for search, O(log n) for insertion/deletion
- Space Complexity: O(n)
- Applications: Database indexing, File systems, Compilers
- Example: B-tree index
- Time Complexity: O(log n) for search, O(n) for insertion/deletion
- Space Complexity: O(n)
- Applications: Expression trees, Syntax trees, Decision trees
- Example: Expression tree
- Time Complexity: O(n) for search, O(n) for insertion/deletion
- Space Complexity: O(n)
- Applications: Linked lists, Stacks and queues, Recursive algorithms
- Example: Linked list
- Time Complexity: O(n) for search, O(n) for traversal
- Space Complexity: O(n)
- Time Complexity: O(n^2)
- Space Complexity: O(1)
- Time Complexity: O(n^2)
- Space Complexity: O(1)
- Time Complexity: O(n^2)
- Space Complexity: O(1)
- Time Complexity: O(n log n)
- Space Complexity: O(n)
- Time Complexity: O(n log n)
- Space Complexity: O(n)
- Time Complexity: O(n)
- Space Complexity: O(1)
- Time Complexity: O(log n)
- Space Complexity: O(1)
- Time Complexity: O(n + m)
- Space Complexity: O(n)
- Time Complexity: O(n + m)
- Space Complexity: O(n)
- Time Complexity: O(n log n + m)
- Space Complexity: O(n)
- Time Complexity: O(n^3)
- Space Complexity: O(n^2)
- Time Complexity: O(n + m)
- Space Complexity: O(n)
- Time Complexity: O(n)
- Space Complexity: O(n)
This repository is licensed under the MIT License. See LICENSE for details.
Contributions are welcome! If you'd like to contribute to this repository, please fork the repository and submit a pull request.
- Ashutosh kumar for creating and maintaining this repository.