Skip to main content
Contents Index
Search Book
Search Results:
No results.
Readability settings Prev Up Next \(\newcommand{\N}{\mathbb N}
\newcommand{\Z}{\mathbb Z}
\newcommand{\Q}{\mathbb Q}
\newcommand{\R}{\mathbb R}
\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 22.18 Summary
In this chapter, we covered the following topics:
Linear and bisection search methods
Bubble, selection, and insertion sort methods
The QuickSort algorithm: pivots, partitioning, and recursion (including debugging it, sorting characters, and choosing a smarter pivot with median-of-three)
Big-O notation and runtime analysis, including best/average/worst case
Sorting records of data (parallel arrays)
Sort arrays
