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.

Sign up for GitHub

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

fix issue #947 #948

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

fix issue #947 #948

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
2b89069
fix issue #947
kwizeras Dec 20, 2024
70f49d4
issue #947 remove explicit
kwizeras Dec 21, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
28 changes: 14 additions & 14 deletions pretext/Sort/SelfCheck.ptx
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,21 +4,21 @@
<exercise label="question_sort_9">
<statement><p>Which of the following sort algorithms are guaranteed to be <m>O(n \log n)</m> even in the worst case?</p></statement>
<choices>
<choice correct="false">
<choice>
<statement>Shell Sort</statement>
<feedback>Shell sort is between <m>O(n)</m> and <m>O(n^2)</m></feedback>
<feedback>Incorrect! Shell sort is between <m>O(n)</m> and <m>O(n^2)</m></feedback>
</choice>
<choice correct="false">
<choice>
<statement>Quick Sort</statement>
<feedback>Quick sort can be <m>O(n \log n)</m>, but if the pivot points are not well chosen and the list is just so, it can be <m>O(n^2)</m>.</feedback>
<feedback>Incorrect! Quick sort can be <m>O(n \log n)</m>, but if the pivot points are not well chosen and the list is just so, it can be <m>O(n^2)</m>.</feedback>
</choice>
<choice correct="true">
<choice correct="yes">
<statement>Merge Sort</statement>
<feedback>Correct! Merge Sort is the only guaranteed <m>O(n \log n)</m> even in the worst case. The cost is that merge sort uses more memory.</feedback>
</choice>
<choice correct="false">
<choice>
<statement>Insertion Sort</statement>
<feedback>Insertion sort is <m>O(n^2)</m></feedback>
<feedback>Incorrect! Insertion sort is <m>O(n^2)</m></feedback>
</choice>
</choices>
</exercise>
Expand All @@ -37,21 +37,21 @@
<exercise label="sortefficiencyrandom">
<statement><p>Which sort should you use for best efficiency If you need to sort through 100,000 random items in a list?</p></statement>
<choices>
<choice correct="true">
<choice correct="yes">
<statement>Merge</statement>
<feedback>Correct!</feedback>
</choice>
<choice correct="false">
<choice>
<statement>Selection</statement>
<feedback>Selection sort is inefficient in large lists.</feedback>
<feedback>Incorrect! Selection sort is inefficient in large lists.</feedback>
</choice>
<choice correct="false">
<choice>
<statement>Bubble</statement>
<feedback>Bubble sort works best with mostly sorted lists.</feedback>
<feedback>Incorrect! Bubble sort works best with mostly sorted lists.</feedback>
</choice>
<choice correct="false">
<choice>
<statement>Insertion</statement>
<feedback>Insertion sort works best with either small or mostly sorted lists.</feedback>
<feedback>Incorrect! Insertion sort works best with either small or mostly sorted lists.</feedback>
</choice>
</choices>
</exercise>
Expand Down