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 2.1 Objectives
-
To understand why algorithm analysis is important.
-
To be able to use “Big-O” to describe execution time.
-
To understand the “Big-O” execution time of common operations on C++ arrays and dictionaries.
-
To understand how the implementation of C++ data impacts algorithm analysis.
-
To understand how to benchmark simple C++ programs.
You have attempted
of
activities on this page.
