4.2 — Void

Void is the easiest of the data types to explain. Basically, means “no type”! Consequentially, variables can not be defined with a type of void: void value; // won’t work, variables can’t be defined with a void type Void is typically used in several different contexts. Most commonly, void is …

2.4 — Introduction to function parameters and arguments

In the previous lesson, we learned that we could have a function return a value back to the function’s caller. We used that to create a modular getValueFromUser function that we used in this program: #include <iostream> int getValueFromUser() { std::cout << “Enter an integer: “; int input{}; std::cin >> …

B.1 — Introduction to C++11

What is C++11? On August 12, 2011, the ISO (International Organization for Standardization) approved a new version of C++, called C++11. C++11 adds a whole new set of features to the C++ language! Use of these new features is entirely optional — but you will undoubtedly find some of them …

21.4 — STL algorithms overview

In addition to container classes and iterators, STL also provides a number of generic algorithms for working with the elements of the container classes. These allow you to do things like search, sort, insert, reorder, remove, and copy elements of the container class. Note that algorithms are implemented as functions …

21.3 — STL iterators overview

An Iterator is an object that can traverse (iterate over) a container class without the user having to know how the container is implemented. With many classes (particularly lists and the associative classes), iterators are the primary way elements of these classes are accessed. An iterator is best visualized as …