Volume 1 (Beginner / No prior programming experience):
In this preview, we'll cover basic
I/O, variables, arithmetic, logic, control flow, functions, and namespaces.
After downloading the preview, please follow the instructions here to
set up an IDE (integrated development environment), which you'll need in order to view and run the included source
Volume 1 (Intermediate):
In this preview, we'll
introduce the concept of dynamic memory allocation and begin writing a dynamic array class (STL vector).
All of the requisite concepts (pointers, arrays, references, templates, typedefs, friend functions, and operator
overloading) are covered in the full version of Volume 1.
In this preview, we'll begin writing a heap
class (STL priority_queue).
All of the requisite concepts (arrays, vectors, deques, binary search trees, templates, and predicates) are covered
in the full version of Volume 1.