We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Consider this case arr[k]>arr[i]>arr[j] in which arr[i] should be median but we get arr[k] as median instead.
arr[k]>arr[i]>arr[j]
Algo/DS Name [Language]
The text was updated successfully, but these errors were encountered:
I'm happy to take a look at this
Sorry, something went wrong.
Fix #436: Median algorithm bug in QuickSort [Python] (#484)
b1b9e13
Successfully merging a pull request may close this issue.
Consider this case
arr[k]>arr[i]>arr[j]
in which arr[i] should be median but we get arr[k] as median instead.Algo/DS Name [Language]
.The text was updated successfully, but these errors were encountered: