Skip to content

Refactor README: Add Algorithms, Reorganize Sections & Fix Documentation #347

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 13 commits into from
Oct 17, 2024
Merged

Refactor README: Add Algorithms, Reorganize Sections & Fix Documentation #347

Changes from 1 commit
Commits
Show all changes
13 commits
Select commit Hold shift + click to select a range
a5da82e
Added Missing Links to Algorithm explanations in README.md
OzPol Sep 25, 2024
3f2033f
Refactor README.md: Organized algorithms table in the Readme alphabet…
OzPol Sep 25, 2024
48b39fd
Merge pull request #1 from OzPol/OzPol-patch-1
OzPol Sep 25, 2024
d20a182
Update README.md : Organized Data Structures and Extra sections
OzPol Sep 25, 2024
96585cd
Fixing Lint check failed case
OzPol Sep 25, 2024
0286192
Merge pull request #2 from OzPol/OzPol-Refactor-DataStructures-and-Ex…
OzPol Sep 25, 2024
43363dc
Added new algorithms and DS with relevant links to the Readme:
OzPol Sep 25, 2024
54759c5
Merge pull request #3 from OzPol/OzPol-add-10-new-algorithms
OzPol Sep 25, 2024
cf4f220
Fix: Updated logos for missing algorithm implementations
OzPol Sep 25, 2024
b2a77b5
Merge pull request #4 from OzPol/OzPol-Fix-Logos-for-new-algos
OzPol Sep 25, 2024
9cb749a
Fix: Updated Python logo placeholders for Red-Black Tree and Bellman-…
OzPol Sep 25, 2024
8d84489
Merge pull request #5 from OzPol/OzPol-Fix-Logos-for-new-algos
OzPol Sep 25, 2024
e81fc16
Merge branch 'main' into main
OzPol Oct 13, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
18 changes: 9 additions & 9 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1167,7 +1167,7 @@ In order to achieve greater coverage and encourage more people to contribute to
</td>
</tr>
<tr>
<td>Min and Max (Iterative)</td>
<td><a href="https://www.geeksforgeeks.org/maximum-and-minimum-in-an-array/">Min and Max (Iterative)</a></td>
<td> <!-- C -->
<a href="./src/c/MinMaxIterative.c">
<img align="center" height="25" src="./logos/c.svg" />
Expand Down Expand Up @@ -1283,7 +1283,7 @@ In order to achieve greater coverage and encourage more people to contribute to
</td>
</tr>
<tr>
<td>Min and Max (D&C)</td>
<td><a href="https://www.tutorialspoint.com/data_structures_algorithms/max_min_problem.htm">Min and Max (D&C)</a></td>
<td> <!-- C -->
<a href="./src/c/MinMaxDC.c">
<img align="center" height="25" src="./logos/c.svg" />
Expand Down Expand Up @@ -2271,7 +2271,7 @@ In order to achieve greater coverage and encourage more people to contribute to
</td>
</tr>
<tr>
<td>Sorted Linked List</td>
<td><a href="https://www.geeksforgeeks.org/sorting-a-singly-linked-list/">Sorted Linked List</a></td>
<td> <!-- C -->
<a href="./src/c/SortedLinkedList.c">
<img align="center" height="25" src="./logos/c.svg" />
Expand Down Expand Up @@ -2445,7 +2445,7 @@ In order to achieve greater coverage and encourage more people to contribute to
</td>
</tr>
<tr>
<td>Dynamic Stack</td>
<td><a href="https://www.geeksforgeeks.org/implement-dynamic-multi-stack-k-stacks-using-only-one-data-structure/?ref=oin_asr3">Dynamic Stack</a></td>
<td> <!-- C -->
<a href="./src/c/DynamicStack.c">
<img align="center" height="25" src="./logos/c.svg" />
Expand Down Expand Up @@ -3609,7 +3609,7 @@ In order to achieve greater coverage and encourage more people to contribute to
</td>
</tr>
<tr>
<td>Queue using Stacks</td>
<td><a href="https://www.geeksforgeeks.org/queue-using-stacks/">Queue using Stacks</a></td>
<td> <!-- C -->
<a href="./CONTRIBUTING.md">
<img align="center" height="25" src="./logos/github.svg" />
Expand Down Expand Up @@ -3667,7 +3667,7 @@ In order to achieve greater coverage and encourage more people to contribute to
</td>
</tr>
<tr>
<td>Two-Sum Problem</td>
<td><a href="https://www.geeksforgeeks.org/check-if-pair-with-given-sum-exists-in-array/">Two-Sum Problem</a></td>
<td> <!-- C -->
<a href="./src/c/TwoSum.c">
<img align="center" height="25" src="./logos/c.svg" />
Expand Down Expand Up @@ -3783,7 +3783,7 @@ In order to achieve greater coverage and encourage more people to contribute to
</td>
</tr>
<tr>
<td>Isogram</td>
<td><a href="https://www.geeksforgeeks.org/check-string-isogram-not/">Isogram</a></td>
<td> <!-- C -->
<a href="./CONTRIBUTING.md">
<img align="center" height="25" src="./logos/github.svg" />
Expand Down Expand Up @@ -3957,7 +3957,7 @@ In order to achieve greater coverage and encourage more people to contribute to
</td>
</tr>
<tr>
<td>Rotten Oranges</td>
<td><a href="https://www.geeksforgeeks.org/minimum-time-required-so-that-all-oranges-become-rotten/">Rotten Oranges</a></td>
<td> <!-- C -->
<a href="./CONTRIBUTING.md">
<img align="center" height="25" src="./logos/github.svg" />
Expand Down Expand Up @@ -4015,7 +4015,7 @@ In order to achieve greater coverage and encourage more people to contribute to
</td>
</tr>
<tr>
<td>Find Distinct Subsets</td>
<td><a href="https://www.geeksforgeeks.org/find-all-unique-subsets-of-a-given-set/">Find Distinct Subsets</a></td>
<td> <!-- C -->
<a href="./CONTRIBUTING.md">
<img align="center" height="25" src="./logos/github.svg" />
Expand Down