Radix sort,Shell sort,Kruskals Algo Added :fixes #1908 #1909 #1911 #1934
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
Idea Description Prim's Algorithm (Minimum Spanning Tree) is To find a Minimum Spanning Tree (MST) for a weighted, undirected graph. Potential Benefits Improves user experience Enhances learning Adds a new feature Improves code quality Other
|
Thank you for submitting your pull request! 🙌 We'll review it as soon as possible.). If there are any specific instructions or feedback regarding your PR, we'll provide them here. Thanks again for your contribution! 😊 |
⚡️ Lighthouse Report for the Deploy Preview of this PR 🚀
|
Kruskal's Algorithm #1911 add a new greedy algorithm Idea Description Another MST algorithm that works by sorting all edges. Potential Benefits Improves user experience Enhances learning Adds a new feature Improves code quality Other
Radix sort #1908 Idea Description This algorithm sorts numbers by processing individual digits, starting from the least significant digit to the most significant digit (LSD Radix Sort). It’s suitable for integers or strings. Potential Benefits Improves user experience Enhances learning Adds a new feature Improves code quality Other
Shell Sort #1909 Idea Title Add a new sorting algorithm Idea Description An optimized version of insertion sort. Shell Sort sorts elements far apart first, then progressively reduces the gap. Potential Benefits Improves user experience Enhances learning Adds a new feature Improves code quality Other
laxmikandivalasa
changed the title
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.
Idea Description
Radix sort Added : #1908
Prim's Algorithm (Minimum Spanning Tree)
is To find a Minimum Spanning Tree (MST) for a weighted, undirected graph.
Potential Benefits
Improves user experience
Enhances learning
Adds a new feature
Improves code quality
Other