INTRO: Introduction
We will continue our discussion of C++ arrays.
We start by looking at how a numeric array can be sorted. One
simple method assumes we have all the numbers available at the
beginning. The second method can be used even in the case where
the entries in the array become available one at a time, as though
someone were dealing us a hand of cards.
We then look at how arrays can be passed to a function, and notice
something surprising about how data changes occurring inside a
function may or may not be returned to the calling program.
We take a look at the mathematical topic of polynomials, and
consider how some useful operations involving polynomials can be
implemented in C++.
4 / 1