Implementations of algorithms in C++
- C++ 100%
| conversion_algos | Adding roman to int conversion | |
| dynamic_programming | Add: Adding string matching, graphs and DP | |
| graphs | Add: Adding string matching, graphs and DP | |
| math | Adding algo to return the absolute number | |
| searching | small changes | |
| sorting | Sorting: MultiThreaded Merge Sort | |
| string_matching | Add: Adding string matching, graphs and DP | |
| validation_algos | Rename | |
| README.md | updating readme | |
C++ DSA
This repository serves as a comprehensive collection of Data Structures and Algorithms (DSA) implementations in C++. The aim is to provide clear, well-documented, and efficient solutions to fundamental problems, continuously expanding with new algorithms or data structure everyday.
Table of Contents
Algorithms
This section includes implementations of various algorithms, categorized by their primary function.
Sorting Algorithms
- Bubble Sort
- Selection Sort
- Insertion Sort
- Merge Sort
- Quick Sort
- Bogo Sort
- Shell Sort
- Counting Sort
Searching Algorithms
- Linear Search
- Binary Search
- Ternary Search
- Interpolation Search
Conversion Algorithms
- Integer To Roman
- Roman To Integer
Checksum
- Luhn Validation (modulo 10)
Contributing
Contributions are welcome and highly appreciated. If you have an implementation of a data structure or an algorithm that is not yet present, or if you find an issue with an existing implementation, please feel free to contribute.
To contribute:
- Fork the repository.
- Create a new branch for your feature or bug fix.
- Implement your changes, ensuring code quality and proper documentation.
- Submit a pull request with a clear description of your changes.
Please ensure your code is well-tested before creating a PR