From a5da82e4d054ae5dacc396b45f297a7f4a00f393 Mon Sep 17 00:00:00 2001 From: Ozlem <95313700+OzPol@users.noreply.github.com> Date: Tue, 24 Sep 2024 23:01:51 -0400 Subject: [PATCH 1/7] Added Missing Links to Algorithm explanations in README.md Added missing links for - Min and Max (Iterative) - Min and Max (D&C) - Sorted Linked List - Dynamic Stack - Queue using Stacks - Two-Sum Problem - Isogram - Rotten Oranges - Find Distinct Subsets Improved documentation by providing reliable external resources for better understanding of these algorithms. --- README.md | 18 +++++++++--------- 1 file changed, 9 insertions(+), 9 deletions(-) diff --git a/README.md b/README.md index 39ae7d05..383ed62c 100644 --- a/README.md +++ b/README.md @@ -1167,7 +1167,7 @@ In order to achieve greater coverage and encourage more people to contribute to - Min and Max (Iterative) + Min and Max (Iterative) @@ -1283,7 +1283,7 @@ In order to achieve greater coverage and encourage more people to contribute to - Min and Max (D&C) + Min and Max (D&C) @@ -2271,7 +2271,7 @@ In order to achieve greater coverage and encourage more people to contribute to - Sorted Linked List + Sorted Linked List @@ -2445,7 +2445,7 @@ In order to achieve greater coverage and encourage more people to contribute to - Dynamic Stack + Dynamic Stack @@ -3609,7 +3609,7 @@ In order to achieve greater coverage and encourage more people to contribute to - Queue using Stacks + Queue using Stacks @@ -3667,7 +3667,7 @@ In order to achieve greater coverage and encourage more people to contribute to - Two-Sum Problem + Two-Sum Problem @@ -3783,7 +3783,7 @@ In order to achieve greater coverage and encourage more people to contribute to - Isogram + Isogram @@ -3957,7 +3957,7 @@ In order to achieve greater coverage and encourage more people to contribute to - Rotten Oranges + Rotten Oranges @@ -4015,7 +4015,7 @@ In order to achieve greater coverage and encourage more people to contribute to - Find Distinct Subsets + Find Distinct Subsets From 3f2033f6caa28e8c123276619330aee14fbfd222 Mon Sep 17 00:00:00 2001 From: Ozlem <95313700+OzPol@users.noreply.github.com> Date: Tue, 24 Sep 2024 23:38:40 -0400 Subject: [PATCH 2/7] Refactor README.md: Organized algorithms table in the Readme alphabetically for improved structure and ease of navigation. Enhanced clarity by reordering entries. --- README.md | 814 +++++++++++++++++++++++++++--------------------------- 1 file changed, 407 insertions(+), 407 deletions(-) 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 - + - - + + From d20a1823aacb2d3d6d6ed8c3bebdced8cf1667a1 Mon Sep 17 00:00:00 2001 From: Ozlem <95313700+OzPol@users.noreply.github.com> Date: Wed, 25 Sep 2024 15:00:43 -0400 Subject: [PATCH 3/7] Update README.md : Organized Data Structures and Extra sections Refactor: Organized Data Structures and Extra sections alphabetically in the README for improved clarity and ease of navigation. --- README.md | 506 +++++++++++++++++++++++++++--------------------------- 1 file changed, 253 insertions(+), 253 deletions(-) diff --git a/README.md b/README.md index 13402b67..9cb1522e 100644 --- a/README.md +++ b/README.md @@ -1691,24 +1691,24 @@ In order to achieve greater coverage and encourage more people to contribute to - Binary Tree + Binary Search Tree - + - + - + - + @@ -1718,13 +1718,13 @@ In order to achieve greater coverage and encourage more people to contribute to - + - - + + @@ -1749,24 +1749,24 @@ In order to achieve greater coverage and encourage more people to contribute to - Binary Search Tree + Binary Tree - + - + - + - + @@ -1776,13 +1776,13 @@ In order to achieve greater coverage and encourage more people to contribute to - + - - + + @@ -1807,10 +1807,10 @@ In order to achieve greater coverage and encourage more people to contribute to - Double-ended Queue + Circular Linked List - - + + @@ -1824,33 +1824,33 @@ In order to achieve greater coverage and encourage more people to contribute to - + - - + + - - + + - - + + - - + + - - + + @@ -1865,10 +1865,10 @@ In order to achieve greater coverage and encourage more people to contribute to - Queue + Double-ended Queue - - + + @@ -1877,43 +1877,43 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + - + - - + + - + - + - + - + - - + + @@ -1981,15 +1981,15 @@ In order to achieve greater coverage and encourage more people to contribute to - Graph + Dynamic Stack - + - - + + @@ -1998,8 +1998,8 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + @@ -2023,8 +2023,8 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + @@ -2039,40 +2039,40 @@ In order to achieve greater coverage and encourage more people to contribute to - Circular Linked List + Doubly Linked List - + - - + + - - + + - + - - + + - - + + - - + + @@ -2081,8 +2081,8 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + @@ -2096,16 +2096,16 @@ In order to achieve greater coverage and encourage more people to contribute to - - Singly Linked List + + Graph - + - - + + @@ -2114,32 +2114,32 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + - - + + - - + + - - + + - - + + - + @@ -2155,40 +2155,40 @@ In order to achieve greater coverage and encourage more people to contribute to - Doubly Linked List + Hash Table - - + + - - + + - - + + - + - - + + - + - - + + @@ -2197,8 +2197,8 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + @@ -2213,9 +2213,9 @@ In order to achieve greater coverage and encourage more people to contribute to - Unordered Linked List + Queue - + @@ -2225,43 +2225,43 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + - + - - + + - - + + - - + + - - + + - - + + - - + + @@ -2271,10 +2271,10 @@ In order to achieve greater coverage and encourage more people to contribute to - Sorted Linked List + Ring Buffer - - + + @@ -2288,13 +2288,13 @@ In order to achieve greater coverage and encourage more people to contribute to - + - - + + @@ -2329,15 +2329,15 @@ In order to achieve greater coverage and encourage more people to contribute to - Skip List + Singly Linked List - - + + - - + + @@ -2346,33 +2346,33 @@ In order to achieve greater coverage and encourage more people to contribute to - + - - + + - - + + - - + + - - + + - - + + @@ -2387,55 +2387,55 @@ In order to achieve greater coverage and encourage more people to contribute to - Stack + Skip List - - + + - - + + - - + + - + - - + + - - + + - - + + - - + + - - + + - - + + @@ -2445,15 +2445,15 @@ In order to achieve greater coverage and encourage more people to contribute to - Dynamic Stack + Sorted Linked List - + - - + + @@ -2462,13 +2462,13 @@ In order to achieve greater coverage and encourage more people to contribute to - + - - + + @@ -2503,55 +2503,55 @@ In order to achieve greater coverage and encourage more people to contribute to - Ring Buffer + Stack - - + + - - + + - - + + - + - - + + - - + + - - + + - - + + - - + + - - + + @@ -2561,10 +2561,10 @@ In order to achieve greater coverage and encourage more people to contribute to - Hash Table + Unordered Linked List - - + + @@ -2578,18 +2578,18 @@ In order to achieve greater coverage and encourage more people to contribute to - + - - + + - - + + @@ -3609,15 +3609,15 @@ In order to achieve greater coverage and encourage more people to contribute to - Queue using Stacks + Find Distinct Subsets - - + + @@ -3626,8 +3626,8 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + @@ -3667,30 +3667,30 @@ In order to achieve greater coverage and encourage more people to contribute to - Two-Sum Problem + Isogram - - + + - - + + - - + + - - + + - - + + @@ -3709,8 +3709,8 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + @@ -3725,55 +3725,55 @@ In order to achieve greater coverage and encourage more people to contribute to - Palindrome + Leibniz Formula for Pi - + - + - + - + - - + + - + - + - + - + - - + + @@ -3783,7 +3783,7 @@ In order to achieve greater coverage and encourage more people to contribute to - Isogram + Maze-Solving Algorithm @@ -3800,13 +3800,13 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + - - + + @@ -3841,55 +3841,55 @@ In order to achieve greater coverage and encourage more people to contribute to - Leibniz Formula for Pi + Palindrome - + - + - + - + - - + + - + - + - + - + - - + + @@ -3899,7 +3899,7 @@ In order to achieve greater coverage and encourage more people to contribute to - Maze-Solving Algorithm + Queue using Stacks @@ -3916,7 +3916,7 @@ In order to achieve greater coverage and encourage more people to contribute to - + @@ -4015,25 +4015,25 @@ In order to achieve greater coverage and encourage more people to contribute to - Find Distinct Subsets + Two-Sum Problem - - + + - + - - + + - - + + @@ -4057,8 +4057,8 @@ In order to achieve greater coverage and encourage more people to contribute to - - + + From 96585cd5c7c19979dc13410684f5d1889764795a Mon Sep 17 00:00:00 2001 From: Ozlem <95313700+OzPol@users.noreply.github.com> Date: Wed, 25 Sep 2024 15:17:59 -0400 Subject: [PATCH 4/7] Fixing Lint check failed case Corrected file path for 'CalculatePi.cpp' in the README (Line 3735) and removed extra tab causing whitespace issue on line 2099. --- README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index 9cb1522e..4e7dd6b8 100644 --- a/README.md +++ b/README.md @@ -2096,7 +2096,7 @@ In order to achieve greater coverage and encourage more people to contribute to - + Graph @@ -3732,7 +3732,7 @@ In order to achieve greater coverage and encourage more people to contribute to - + 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 5/7] 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 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + From cf4f22073c5eab07e297bf48e1bb8f086c64245b Mon Sep 17 00:00:00 2001 From: Ozlem <95313700+OzPol@users.noreply.github.com> Date: Wed, 25 Sep 2024 16:21:25 -0400 Subject: [PATCH 6/7] Fix: Updated logos for missing algorithm implementations Replaced C and Python logos with GitHub logo for the following algorithms with missing implementations: 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 | 36 ++++++++++++++++++------------------ 1 file changed, 18 insertions(+), 18 deletions(-) diff --git a/README.md b/README.md index 1db56218..69bf752f 100644 --- a/README.md +++ b/README.md @@ -68,7 +68,7 @@ In order to achieve greater coverage and encourage more people to contribute to
A* Algorithm - + @@ -83,7 +83,7 @@ In order to achieve greater coverage and encourage more people to contribute to - + @@ -126,7 +126,7 @@ In order to achieve greater coverage and encourage more people to contribute to Bellman-Ford Algorithm - + @@ -822,7 +822,7 @@ In order to achieve greater coverage and encourage more people to contribute to Ford-Fulkerson Algorithm - + @@ -837,7 +837,7 @@ In order to achieve greater coverage and encourage more people to contribute to - + @@ -880,7 +880,7 @@ In order to achieve greater coverage and encourage more people to contribute to Gale-Shapley Algorithm - + @@ -895,7 +895,7 @@ In order to achieve greater coverage and encourage more people to contribute to - + @@ -1170,7 +1170,7 @@ In order to achieve greater coverage and encourage more people to contribute to Hungarian Algorithm - + @@ -1185,7 +1185,7 @@ In order to achieve greater coverage and encourage more people to contribute to - + @@ -1344,7 +1344,7 @@ In order to achieve greater coverage and encourage more people to contribute to Kruskal's Algorithm - + @@ -1359,7 +1359,7 @@ In order to achieve greater coverage and encourage more people to contribute to - + @@ -1866,7 +1866,7 @@ In order to achieve greater coverage and encourage more people to contribute to Prim's Algorithm - + @@ -1881,7 +1881,7 @@ In order to achieve greater coverage and encourage more people to contribute to - + @@ -2100,7 +2100,7 @@ In order to achieve greater coverage and encourage more people to contribute to AVL Tree - + @@ -2115,7 +2115,7 @@ In order to achieve greater coverage and encourage more people to contribute to - + @@ -2738,7 +2738,7 @@ In order to achieve greater coverage and encourage more people to contribute to Red-Black Tree - + @@ -4074,7 +4074,7 @@ In order to achieve greater coverage and encourage more people to contribute to Topological Sort - + @@ -4089,7 +4089,7 @@ In order to achieve greater coverage and encourage more people to contribute to - + From 9cb749af7577365ce0e80a8dfd052bd616c39f78 Mon Sep 17 00:00:00 2001 From: Ozlem <95313700+OzPol@users.noreply.github.com> Date: Wed, 25 Sep 2024 16:32:32 -0400 Subject: [PATCH 7/7] Fix: Updated Python logo placeholders for Red-Black Tree and Bellman-Ford Red-Black Tree and Bellman-Ford algorithms python placeholder logos changed to the correct GitHub logo. All logos are now consistent across the new additions. --- README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index 69bf752f..08b49401 100644 --- a/README.md +++ b/README.md @@ -141,7 +141,7 @@ In order to achieve greater coverage and encourage more people to contribute to - + @@ -2753,7 +2753,7 @@ In order to achieve greater coverage and encourage more people to contribute to - +