From 43363dc52b1886fbcfad88692c489de5342f1117 Mon Sep 17 00:00:00 2001
From: Ozlem <95313700+OzPol@users.noreply.github.com>
Date: Wed, 25 Sep 2024 15:51:57 -0400
Subject: [PATCH] Added new algorithms and DS with relevant links to the
Readme:
Added the following new algorithms with relevant links to the Readme:
A* Algorithm
Bellman-Ford Algorithm
Ford-Fulkerson Algorithm
Gale-Shapley Algorithm
Hungarian Algorithm
Kruskal's Algorithm
Prim's Algorithm
Topological Sort
AVL Tree
Red-Black Tree
---
README.md | 606 ++++++++++++++++++++++++++++++++++++++++++++++++++++--
1 file changed, 593 insertions(+), 13 deletions(-)
diff --git a/README.md b/README.md
index 4e7dd6b8..1db56218 100644
--- a/README.md
+++ b/README.md
@@ -64,6 +64,122 @@ In order to achieve greater coverage and encourage more people to contribute to
+
+ A* Algorithm |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+ Bellman-Ford Algorithm |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
Binary Search |
@@ -702,6 +818,122 @@ In order to achieve greater coverage and encourage more people to contribute to
|
+
+ Ford-Fulkerson Algorithm |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+ Gale-Shapley Algorithm |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
Genetic Algorithm |
@@ -909,8 +1141,124 @@ In order to achieve greater coverage and encourage more people to contribute to
|
-
-
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+ Hungarian Algorithm |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+ Interpolation Search |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
|
@@ -935,15 +1283,15 @@ In order to achieve greater coverage and encourage more people to contribute to
|
- Interpolation Search |
+ Knight's Tour |
|
-
-
+
+
|
@@ -952,7 +1300,7 @@ In order to achieve greater coverage and encourage more people to contribute to
|
-
+
|
@@ -962,13 +1310,13 @@ In order to achieve greater coverage and encourage more people to contribute to
-
-
+
+
|
-
-
+
+
|
@@ -993,10 +1341,10 @@ In order to achieve greater coverage and encourage more people to contribute to
|
- Knight's Tour |
+ Kruskal's Algorithm |
-
+
|
@@ -1010,7 +1358,7 @@ In order to achieve greater coverage and encourage more people to contribute to
|
-
+
|
@@ -1514,6 +1862,64 @@ In order to achieve greater coverage and encourage more people to contribute to
+
+ Prim's Algorithm |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
Tower of Hanoi |
@@ -1690,6 +2096,64 @@ In order to achieve greater coverage and encourage more people to contribute to
|
+
+ AVL Tree |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
Binary Search Tree |
@@ -2270,6 +2734,64 @@ In order to achieve greater coverage and encourage more people to contribute to
|
+
+ Red-Black Tree |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
Ring Buffer |
@@ -3548,6 +4070,64 @@ In order to achieve greater coverage and encourage more people to contribute to
|
+
+ Topological Sort |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+
+
+
+
+ |
+