diff --git a/README.md b/README.md index 306eb5f3..ac4442ac 100644 --- a/README.md +++ b/README.md @@ -65,40 +65,40 @@ In order to achieve greater coverage and encourage more people to contribute to - Dijkstra's Algorithm + A* Algorithm - - + + - - + + - - + + - - + + - - + + - - + + - - + + @@ -107,13 +107,13 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + - - + + @@ -123,10 +123,10 @@ In order to achieve greater coverage and encourage more people to contribute to - Floyd–Warshall Algorithm + Bellman-Ford Algorithm - - + + @@ -135,18 +135,18 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + - - + + - - + + @@ -239,9 +239,9 @@ In order to achieve greater coverage and encourage more people to contribute to - Graph Search + Connected Components - + @@ -256,8 +256,8 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + @@ -271,8 +271,8 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + @@ -297,54 +297,54 @@ In order to achieve greater coverage and encourage more people to contribute to - Linear Search (Iterative) + Dijkstra's Algorithm - + - + - + - + - - + + - + - + - - + + - + - + @@ -355,24 +355,82 @@ In order to achieve greater coverage and encourage more people to contribute to - Linear Search (Recursive) + Exponentiation (Iterative) - + - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Exponentiation (Recursive) + + + + + + + + + + + + + + + - + @@ -382,55 +440,113 @@ In order to achieve greater coverage and encourage more people to contribute to - + - + + + + + + + + + + + + + + + + + + + Factorial (Iterative) + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + - - + + - + - - + + - Linear Search (Sentinel) + Factorial (Recursive) - + - - + + - - + + - + @@ -440,13 +556,419 @@ In order to achieve greater coverage and encourage more people to contribute to - + - - + + + + + + + + + + + + + + + + + + + + + + + + + + + Fibonacci (Iterative) + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Fibonacci (Memoization) + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Fibonacci (Recursive) + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Floyd–Warshall Algorithm + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Ford-Fulkerson Algorithm + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Gale-Shapley Algorithm + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + Genetic Algorithm + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + @@ -471,15 +993,15 @@ In order to achieve greater coverage and encourage more people to contribute to - Interpolation Search + Graph Search - - + + - - + + @@ -488,7 +1010,7 @@ In order to achieve greater coverage and encourage more people to contribute to - + @@ -498,12 +1020,12 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + - + @@ -529,9 +1051,9 @@ In order to achieve greater coverage and encourage more people to contribute to - Travelling Salesman + Hamiltonian Cycle - + @@ -546,13 +1068,13 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + - - + + @@ -587,10 +1109,10 @@ In order to achieve greater coverage and encourage more people to contribute to - Hamiltonian Cycle + Huffman's Algorithm - - + + @@ -604,8 +1126,8 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + @@ -645,10 +1167,10 @@ In order to achieve greater coverage and encourage more people to contribute to - Connected Components + Hungarian Algorithm - - + + @@ -703,45 +1225,45 @@ In order to achieve greater coverage and encourage more people to contribute to - Exponentiation (Iterative) + Interpolation Search - - + + - + - - + + - + - - + + - + - + - - + + @@ -761,24 +1283,24 @@ In order to achieve greater coverage and encourage more people to contribute to - Exponentiation (Recursive) + Knight's Tour - - + + - - + + - - + + - + @@ -788,23 +1310,23 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + - - + + - - + + - - + + @@ -813,118 +1335,118 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + - Factorial (Iterative) + Kruskal's Algorithm - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - Factorial (Recursive) + Linear Search (Iterative) - + - + - + - + - - + + - + - + - + - + - + @@ -935,176 +1457,176 @@ In order to achieve greater coverage and encourage more people to contribute to - Fibonacci (Iterative) + Linear Search (Recursive) - + - + - - + + - + - - + + - + - + - - + + - + - + - - + + - - Fibonacci (Recursive) + + Linear Search (Sentinel) - + - - + + - - + + - + - - + + - + - + - - + + - - + + - - + + - - + + - - Fibonacci (Memoization) + + LZ77 Algorithm - - + + - - + + - - + + - + - - + + - - + + - - + + - - + + - - + + - - + + - - + + @@ -1167,24 +1689,24 @@ In order to achieve greater coverage and encourage more people to contribute to - Min and Max (Iterative) + Min and Max (D&C) - + - + - - + + - + @@ -1194,13 +1716,13 @@ In order to achieve greater coverage and encourage more people to contribute to - + - - + + @@ -1209,13 +1731,13 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + - - + + @@ -1225,39 +1747,39 @@ In order to achieve greater coverage and encourage more people to contribute to - Min and Max (Recursive) + Min and Max (Iterative) - + - - + + - + - + - - + + - + - + @@ -1267,12 +1789,12 @@ In order to achieve greater coverage and encourage more people to contribute to - + - + @@ -1283,40 +1805,40 @@ In order to achieve greater coverage and encourage more people to contribute to - Min and Max (D&C) + Min and Max (Recursive) - + - - + + - - + + - + - - + + - + - - + + @@ -1325,13 +1847,13 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + - - + + @@ -1341,7 +1863,7 @@ In order to achieve greater coverage and encourage more people to contribute to - Knight's Tour + Prim's Algorithm @@ -1358,8 +1880,8 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + @@ -1457,10 +1979,10 @@ In order to achieve greater coverage and encourage more people to contribute to - Genetic Algorithm + Travelling Salesman - - + + @@ -1474,13 +1996,13 @@ In order to achieve greater coverage and encourage more people to contribute to - + - - + + @@ -1514,66 +2036,68 @@ In order to achieve greater coverage and encourage more people to contribute to + + - - + - - - - - - - - - - - + -
Huffman's Algorithm - - + Data Structures + + - - + + + - - + + + - + + - - + + + - - + + + - - + + + - - + + + - - + + + - - + + + - - + + +
LZ77 AlgorithmAVL Tree @@ -1590,8 +2114,8 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + @@ -1630,63 +2154,61 @@ In order to achieve greater coverage and encourage more people to contribute to
- - - + - - - - - - - - - - @@ -1749,24 +2271,24 @@ In order to achieve greater coverage and encourage more people to contribute to - + @@ -1776,13 +2298,13 @@ In order to achieve greater coverage and encourage more people to contribute to - + @@ -1892,28 +2414,28 @@ In order to achieve greater coverage and encourage more people to contribute to - + @@ -1940,7 +2462,7 @@ In order to achieve greater coverage and encourage more people to contribute to @@ -1981,40 +2503,40 @@ In order to achieve greater coverage and encourage more people to contribute to - + @@ -2039,9 +2561,9 @@ In order to achieve greater coverage and encourage more people to contribute to - + @@ -2056,8 +2578,8 @@ In order to achieve greater coverage and encourage more people to contribute to - + - + - + - + - + - + - - + - + - + + + + + + + + + + + + + + +
Data Structures - + Binary Search Tree + - + + - + + - + + - - + + + - + + - + + - - + + + - - + + + - - + + + - - + + +
Binary Search TreeCircular Linked List - + - - + + - - + + - + - - + + - - + + @@ -1865,24 +2387,24 @@ In order to achieve greater coverage and encourage more people to contribute to
QueueDynamic Queue - + - - + + - - + + - + - - + + - - + + - - + + - - + + - - + + @@ -1923,14 +2445,14 @@ In order to achieve greater coverage and encourage more people to contribute to
Dynamic QueueDynamic Stack - + - + - +
GraphDoubly Linked List - + - - + + - - + + - - + + - - + + - - + + - - + + @@ -2023,7 +2545,7 @@ In order to achieve greater coverage and encourage more people to contribute to - +
Circular Linked ListGraph - + - - + + @@ -2081,8 +2603,8 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + @@ -2097,15 +2619,15 @@ In order to achieve greater coverage and encourage more people to contribute to
Singly Linked ListHash Table - - + + - - + + @@ -2114,33 +2636,33 @@ In order to achieve greater coverage and encourage more people to contribute to - + - - + + - + - - + + - - + + - - + + @@ -2155,55 +2677,55 @@ In order to achieve greater coverage and encourage more people to contribute to
Doubly Linked ListQueue - + - - + + - + - + - - + + - + - + - - + + - + - - + + @@ -2213,10 +2735,10 @@ In order to achieve greater coverage and encourage more people to contribute to
Unordered Linked ListRed-Black Tree - - + + @@ -2230,13 +2752,13 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + - - + + @@ -2271,10 +2793,10 @@ In order to achieve greater coverage and encourage more people to contribute to
Sorted Linked ListRing Buffer - - + + @@ -2288,13 +2810,13 @@ In order to achieve greater coverage and encourage more people to contribute to - + - - + + @@ -2329,15 +2851,15 @@ In order to achieve greater coverage and encourage more people to contribute to
Skip ListSingly Linked List - - + + - - + + @@ -2346,33 +2868,33 @@ In order to achieve greater coverage and encourage more people to contribute to - + - - + + - - + + - - + + - - + + - - + + @@ -2387,55 +2909,55 @@ In order to achieve greater coverage and encourage more people to contribute to
StackSkip List - - + + - - + + - - + + - + - - + + - - + + + - - + + - - + + - - + + - - + + @@ -2445,15 +2967,15 @@ In order to achieve greater coverage and encourage more people to contribute to
Dynamic StackSorted Linked List - + - - + + @@ -2462,13 +2984,13 @@ In order to achieve greater coverage and encourage more people to contribute to - + - - + + @@ -2503,55 +3025,55 @@ In order to achieve greater coverage and encourage more people to contribute to
Ring BufferStack - - + + - - + + - - + + - + - - + + - - + + - - + + - - + + - - + + - - + + @@ -2561,10 +3083,10 @@ In order to achieve greater coverage and encourage more people to contribute to
Hash TableUnordered Linked List - - + + @@ -2578,18 +3100,18 @@ In order to achieve greater coverage and encourage more people to contribute to - + - - + + - - + + @@ -3548,6 +4070,64 @@ In order to achieve greater coverage and encourage more people to contribute to
Topological Sort + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
@@ -3609,15 +4189,15 @@ In order to achieve greater coverage and encourage more people to contribute to - + - + - + - + - + - + @@ -3957,7 +4537,7 @@ In order to achieve greater coverage and encourage more people to contribute to - + - +
Queue using StacksFind Distinct Subsets - - + + @@ -3626,8 +4206,8 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + @@ -3667,30 +4247,30 @@ In order to achieve greater coverage and encourage more people to contribute to
Two-Sum ProblemIsogram - - + + - - + + - - + + - - + + - - + + @@ -3709,8 +4289,8 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + @@ -3725,55 +4305,55 @@ In order to achieve greater coverage and encourage more people to contribute to
PalindromeLeibniz Formula for Pi - + - + - + - + - - + + - + - + - + - + - - + + @@ -3783,7 +4363,7 @@ In order to achieve greater coverage and encourage more people to contribute to
IsogramMaze-Solving Algorithm @@ -3800,13 +4380,13 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + - - + + @@ -3841,55 +4421,55 @@ In order to achieve greater coverage and encourage more people to contribute to
Leibniz Formula for PiPalindrome - + - + - + - + - - + + - + - + - + - + - - + + @@ -3899,7 +4479,7 @@ In order to achieve greater coverage and encourage more people to contribute to
Maze-Solving AlgorithmQueue using Stacks @@ -3916,7 +4496,7 @@ In order to achieve greater coverage and encourage more people to contribute to - +
Rotten OrangesRotten Oranges @@ -4015,25 +4595,25 @@ In order to achieve greater coverage and encourage more people to contribute to
Find Distinct SubsetsTwo-Sum Problem - - + + - + - - + + - - + + @@ -4057,8 +4637,8 @@ In order to achieve greater coverage and encourage more people to contribute to - - + +