Repository navigation
Conversation
qsortEx unconditionally recursed on both subarrays after partitioning. For already sorted or reverse-sorted dynamic arrays, this creates O(N) recursion depth on the C call stack, which can exhaust stack space on large arrays. Recurse only on the smaller partition and iterate on the larger partition, guaranteeing maximum recursion depth bounded by O(log N). Reported-by: BS.ehlas.cz
This branch has not been deployed
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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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.
In
qsortEx, the function unconditionally recursed on both subarrays after partitioning. For already sorted or reverse-sorted dynamic arrays, this creates O(N) recursion depth on the C call stack, which can exhaust stack space and crash when sorting large arrays.This patch updates
qsortExto recurse only on the smaller partition and iterate on the larger partition, guaranteeing that the maximum recursion depth is bounded by O(log N).