optimized code #105
Open
optimized code #105
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
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.
Median-of-Three: Selecting the pivot as the median of the first, middle, and last elements reduces the chance of encountering the worst-case O(n²) time complexity when the input array is already sorted.
Iterative Quick Sort: This implementation uses an explicit stack to manage the subarray indices, avoiding the overhead of recursive function calls and reducing the risk of stack overflow for large arrays.
Space Complexity: While the space complexity remains O(log n) in the average case (for the stack), it is significantly improved over the recursive approach, especially for large datasets.
These changes will help optimize the Quick Sort algorithm in both time and space complexities.