Skip to main content\(
\newcommand{\lt}{<}
\newcommand{\gt}{>}
\newcommand{\amp}{&}
\definecolor{fillinmathshade}{gray}{0.9}
\newcommand{\fillinmath}[1]{\mathchoice{\colorbox{fillinmathshade}{$\displaystyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\textstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptscriptstyle\phantom{\,#1\,}$}}}
\)
Section 7.9 Self Check
Checkpoint 7.9.1.
Which of the following sort algorithms are guaranteed to be
\(O(n \log n)\) even in the worst case?
Incorrect! Shell sort is between \(O(n)\) and \(O(n^2)\)
Incorrect! Quick sort can be \(O(n \log n)\text{,}\) but if the pivot points are not well chosen and the list is just so, it can be \(O(n^2)\text{.}\)
Correct! Merge Sort is the only guaranteed \(O(n \log n)\) even in the worst case. The cost is that merge sort uses more memory.
Incorrect! Insertion sort is \(O(n^2)\)
Checkpoint 7.9.2.
Checkpoint 7.9.3.
Which sort should you use for best efficiency If you need to sort through 100,000 random items in a list?
Correct!
Incorrect! Selection sort is inefficient in large lists.
Incorrect! Bubble sort works best with mostly sorted lists.
Incorrect! Insertion sort works best with either small or mostly sorted lists.
You have attempted
of
activities on this page.
