Skip to content
New issue

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

Typo in 5.12. The Quick Sort #59

Open
yay-jake opened this issue Dec 17, 2018 · 0 comments
Open

Typo in 5.12. The Quick Sort #59

yay-jake opened this issue Dec 17, 2018 · 0 comments

Comments

@yay-jake
Copy link

The idea is that in the case where the the first item in the list does not belong toward the middle of the list, the median of three will choose a better “middle” value.

http://interactivepython.org/courselib/static/pythonds/SortSearch/TheQuickSort.html

@bnmnetp bnmnetp transferred this issue from RunestoneInteractive/RunestoneComponents Dec 22, 2018
yasinovskyy added a commit to yasinovskyy/pythonds-runestone that referenced this issue Aug 19, 2019
@yasinovskyy yasinovskyy mentioned this issue Aug 19, 2019
jdeisenberg pushed a commit to jdeisenberg/pythonds that referenced this issue Jul 25, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant