Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/aliosm/adt
Standard implementation of Algorithms, Data structures and Techniques.
https://github.com/aliosm/adt
algorithms data-structures techniques
Last synced: 23 days ago
JSON representation
Standard implementation of Algorithms, Data structures and Techniques.
- Host: GitHub
- URL: https://github.com/aliosm/adt
- Owner: AliOsm
- License: mit
- Created: 2017-11-14T09:05:36.000Z (about 7 years ago)
- Default Branch: master
- Last Pushed: 2020-02-14T01:18:48.000Z (almost 5 years ago)
- Last Synced: 2025-01-02T07:58:41.835Z (25 days ago)
- Topics: algorithms, data-structures, techniques
- Language: C++
- Homepage:
- Size: 44.9 KB
- Stars: 6
- Watchers: 5
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# ADT
[](#contributors)
Standard implementation of **A**lgorithms, **D**ata structures and **T**echniques.
This repository was created to gather the standard implementation for the most known algorithms in different programming languages.
## Implemented Stuffs
```
ADT
├── Algorithms
│ ├── Graph
│ │ ├── Breadth First Search
│ │ ├── Depth First Search
│ │ ├── Dijkstra
│ │ ├── Floyd-Warshall
│ │ ├── Prim
│ │ ├── Kruskal
│ │ └── Topological Sort
│ ├── Math
│ │ ├── Fast Power
│ │ ├── n Choose k
│ │ └── Number Theory
│ │ ├── N'th Catalan Number
│ │ ├── Greatest Common Divisor
│ │ ├── Least Common Multiple
│ │ └── Prime Numbers
│ │ └── Sieve of Eratosthenes
│ └── Sort
│ ├── Insertion Sort
│ ├── Merge Sort
│ ├── Heap Sort
│ ├── Bubble Sort
│ ├── Counting Sort
│ ├── Quick Sort
│ └── Selection Sort
├── Data Structures
│ ├── Doubly Linked List
│ ├── Linked List
│ └── Trie
└── Techniques
└── Dynamic Programming
└── Longest Increasing Subsequence
```
## Implemented Soon
```
ADT
├── Algorithms
│ ├── Graph
│ │ ├── Articular Points
│ │ ├── Bellman-Ford
│ │ ├── Bridges
│ │ ├── Johnson
│ │ ├── Least Common Ancestor
│ │ └── Tarjan
│ ├── Math
│ │ └── Number Theory
│ │ ├── Extended GCD
│ │ └── Miller Primarity Test
│ └── String
│ ├── KMP
│ └── Z
├── Data Structures
│ ├── Binary Indexed Tree
│ ├── Binary Search Tree
│ ├── Binary Tree
│ ├── Disjoint Set Union
│ ├── Segment Tree
│ └── Sparse Table
└── Techniques
└── Dynamic Programming
├── Coin Exchange Problem
├── Edit Distance Problem
├── Longest Common Subsequence
├── Longest Common Substring
├── Longest Decreasing Subsequence
└── Travelling Salesman Problem
```
## Contributors
Thanks goes to these wonderful people ([emoji key][emojis]):
| [
Ali Hamdi Ali Fadel](http://fb.com/aliosm97)
[💻](https://github.com/AliOsm/Algorithms/commits?author=AliOsm "Code") [📖](https://github.com/AliOsm/Algorithms/commits?author=AliOsm "Documentation") [🤔](#ideas-AliOsm "Ideas, Planning, & Feedback") [👀](#review-AliOsm "Reviewed Pull Requests") [⚠️](https://github.com/AliOsm/Algorithms/commits?author=AliOsm "Tests") | [
Ibraheem Tuffaha](https://github.com/IbraheemTuffaha)
[💻](https://github.com/AliOsm/Algorithms/commits?author=IbraheemTuffaha "Code") [📖](https://github.com/AliOsm/Algorithms/commits?author=IbraheemTuffaha "Documentation") [🤔](#ideas-IbraheemTuffaha "Ideas, Planning, & Feedback") [👀](#review-IbraheemTuffaha "Reviewed Pull Requests") [⚠️](https://github.com/AliOsm/Algorithms/commits?author=IbraheemTuffaha "Tests") |
| :---: | :---: |
This project follows the [all-contributors][all-contributors] specification.
Contributions of any kind are welcome!
## Contributing
Bug reports and pull requests are welcome on GitHub at https://github.com/AliOsm/ADT.
## License
The project is available as open source under the terms of the [MIT License](https://opensource.org/licenses/MIT).
[emojis]: https://github.com/kentcdodds/all-contributors#emoji-key
[all-contributors]: https://github.com/kentcdodds/all-contributors