Add quicksort implementation with comprehensive tests #3
Conversation
This file contains hidden or 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
Implemented a generic quicksort algorithm that works with any type implementing Ord + Clone. The implementation includes: - In-place quicksort using the Lomuto partition scheme - Generic support for any comparable type - Comprehensive test suite covering: - Empty arrays - Single elements - Already sorted arrays - Reverse sorted arrays - Unsorted arrays with duplicates - Negative numbers - String sorting - Large arrays (1000 elements)
Author
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.
Summary
Implemented a new
quicksortcrate that provides a generic quicksort algorithm.Key features:
Ord + CloneTest coverage:
All 9 tests pass successfully.
Changes
crates/quicksort/with implementation and testsCargo.tomlto include the new crate in the workspace