Create Quick Sort on Linked list in java #320
Closed
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
|
@Ayu-hack kindly review my PR and add hacktoberfest label |
Ayu-hack
added
good first issue
|
Please share the screenshot. |
Ayu-hack
removed
good first issue
|
Closed due to no response |
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.
This Java code implements quick sort for a singly linked list. It uses a recursive approach to divide the list around a pivot, arranging nodes so that smaller elements appear before and larger elements after the pivot. The quickSort function sorts segments of the list around the pivot until the entire list is sorted. The insert method adds nodes to the list, and printList displays the list before and after sorting.
#47