diff --git a/README.md b/README.md index 383ed62c..13402b67 100644 --- a/README.md +++ b/README.md @@ -65,55 +65,55 @@ In order to achieve greater coverage and encourage more people to contribute to - Dijkstra's Algorithm + Binary Search - + - + - + - + - + - + - + - - + + - + - - + + @@ -123,9 +123,9 @@ In order to achieve greater coverage and encourage more people to contribute to - Floyd–Warshall Algorithm + Connected Components - + @@ -135,18 +135,18 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + - - + + - - + + @@ -181,55 +181,55 @@ In order to achieve greater coverage and encourage more people to contribute to - Binary Search + Dijkstra's Algorithm - + - + - + - + - + - + - + - - + + - + - - + + @@ -239,45 +239,45 @@ In order to achieve greater coverage and encourage more people to contribute to - Graph Search + Exponentiation (Iterative) - + - - + + - - + + - + - - + + - - + + - + - - + + @@ -297,140 +297,140 @@ In order to achieve greater coverage and encourage more people to contribute to - Linear Search (Iterative) + Exponentiation (Recursive) - + - + - + - + - - + + - + - + - + - + - - + + - - + + - Linear Search (Recursive) + Factorial (Iterative) - + - + - - + + - + - - + + - + - + - - + + - - + + - + - - + + - Linear Search (Sentinel) + Factorial (Recursive) - + - - + + - - + + - + @@ -440,28 +440,28 @@ In order to achieve greater coverage and encourage more people to contribute to - + - + - - + + - - + + - - + + @@ -471,183 +471,183 @@ In order to achieve greater coverage and encourage more people to contribute to - Interpolation Search + Fibonacci (Iterative) - - + + - + - - + + - + - - + + - + - + - - + + - - + + - - + + - - + + - Travelling Salesman + Fibonacci (Memoization) - + - - + + - - + + - + - + - - + + - - + + - - + + - - + + - - + + - - + + - Hamiltonian Cycle + Fibonacci (Recursive) - + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - Connected Components + Floyd–Warshall Algorithm - + @@ -657,18 +657,18 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + - - + + - - + + @@ -703,45 +703,45 @@ In order to achieve greater coverage and encourage more people to contribute to - Exponentiation (Iterative) + Genetic Algorithm - - + + - - + + - - + + - + - - + + - - + + - - + + - - + + @@ -761,24 +761,24 @@ In order to achieve greater coverage and encourage more people to contribute to - Exponentiation (Recursive) + Graph Search - + - - + + - - + + - + @@ -788,23 +788,23 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + - + - - + + - - + + @@ -813,88 +813,88 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + - Factorial (Iterative) + Hamiltonian Cycle - + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - Factorial (Recursive) + Huffman's Algorithm - - + + - - + + - - + + - + @@ -904,28 +904,28 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + - - + + - - + + - - + + - - + + @@ -935,198 +935,198 @@ In order to achieve greater coverage and encourage more people to contribute to - Fibonacci (Iterative) + Interpolation Search - - + + - + - - + + - + - - + + - + - + - - + + - - + + - - + + - - + + - - Fibonacci (Recursive) + + Knight's Tour - - + + - - + + - - + + - + - - + + - - + + - - + + - - + + - - + + - - + + - - + + - - Fibonacci (Memoization) + + Linear Search (Iterative) - + - + - + - + - - + + - + - + - + - + - + - - + + - Max (Recursive) + Linear Search (Recursive) - + - + - - + + - + @@ -1136,12 +1136,12 @@ In order to achieve greater coverage and encourage more people to contribute to - + - + @@ -1151,12 +1151,12 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + - + @@ -1167,24 +1167,24 @@ In order to achieve greater coverage and encourage more people to contribute to - Min and Max (Iterative) + Linear Search (Sentinel) - + - - + + - - + + - + @@ -1194,12 +1194,12 @@ In order to achieve greater coverage and encourage more people to contribute to - + - + @@ -1209,13 +1209,13 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + - - + + @@ -1225,10 +1225,10 @@ In order to achieve greater coverage and encourage more people to contribute to - Min and Max (Recursive) + LZ77 Algorithm - - + + @@ -1237,28 +1237,28 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + - + - - + + - - + + - - + + @@ -1267,13 +1267,13 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + - - + + @@ -1283,24 +1283,24 @@ In order to achieve greater coverage and encourage more people to contribute to - Min and Max (D&C) + Max (Recursive) - + - + - - + + - + @@ -1310,13 +1310,13 @@ In order to achieve greater coverage and encourage more people to contribute to - + - - + + @@ -1330,8 +1330,8 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + @@ -1341,15 +1341,15 @@ In order to achieve greater coverage and encourage more people to contribute to - Knight's Tour + Min and Max (D&C) - - + + - - + + @@ -1358,7 +1358,7 @@ In order to achieve greater coverage and encourage more people to contribute to - + @@ -1368,8 +1368,8 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + @@ -1399,54 +1399,54 @@ In order to achieve greater coverage and encourage more people to contribute to - Tower of Hanoi + Min and Max (Iterative) - + - + - + - + - - + + - + - + - - + + - + - + @@ -1457,10 +1457,10 @@ In order to achieve greater coverage and encourage more people to contribute to - Genetic Algorithm + Min and Max (Recursive) - - + + @@ -1469,28 +1469,28 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + - + - - + + - - + + - - + + @@ -1499,13 +1499,13 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + - - + + @@ -1515,55 +1515,55 @@ In order to achieve greater coverage and encourage more people to contribute to - Huffman's Algorithm + Tower of Hanoi - - + + - - + + - - + + - + - - + + - - + + - - + + - - + + - - + + - - + + @@ -1573,10 +1573,10 @@ In order to achieve greater coverage and encourage more people to contribute to - LZ77 Algorithm + Travelling Salesman - - + + @@ -1590,13 +1590,13 @@ In order to achieve greater coverage and encourage more people to contribute to - + - - + +