Standard implementation of Algorithms, Data structures and Techniques.
This repository was created to gather the standard implementation for the most known algorithms in different programming languages.
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
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
Thanks goes to these wonderful people (emoji key):
 Ali Hamdi Ali Fadel 💻 📖 🤔 👀 |
 Ibraheem Tuffaha 💻 📖 🤔 👀 |
|---|
This project follows the all-contributors specification. Contributions of any kind are welcome!
Bug reports and pull requests are welcome on GitHub at https://github.com/AliOsm/ADT.
The project is available as open source under the terms of the MIT License.