-
Notifications
You must be signed in to change notification settings - Fork 267
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.
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
Refactor README: Add Algorithms, Reorganize Sections & Fix Documentation #347
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
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.
…ically for improved structure and ease of navigation. Enhanced clarity by reordering entries.
Refactored README.md: Organized algorithms table alphabetically
Refactor: Organized Data Structures and Extra sections alphabetically in the README for improved clarity and ease of navigation.
Corrected file path for 'CalculatePi.cpp' in the README (Line 3735) and removed extra tab causing whitespace issue on line 2099.
…tra-tables Update README.md : Organized Data Structures and Extra sections
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
Added new algorithms and DS with relevant links to the Readme:
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
Fix: Updated logos for missing algorithm implementations in Readme
…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.
Fix: Updated Python logo placeholders for RedBlackTree & BellmanFord
kelvins
approved these changes
Oct 17, 2024
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Nice, it looks good to me! Thanks a lot! 👏
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Description