Book Image

C++ Fundamentals

By : Antonio Mallia, Francesco Zoffoli
Book Image

C++ Fundamentals

By: Antonio Mallia, Francesco Zoffoli

Overview of this book

C++ Fundamentals begins by introducing you to the C++ compilation model and syntax. You will then study data types, variable declaration, scope, and control flow statements. With the help of this book, you'll be able to compile fully working C++ code and understand how variables, references, and pointers can be used to manipulate the state of the program. Next, you will explore functions and classes — the features that C++ offers to organize a program — and use them to solve more complex problems. You will also understand common pitfalls and modern best practices, especially the ones that diverge from the C++98 guidelines. As you advance through the chapters, you'll study the advantages of generic programming and write your own templates to make generic algorithms that work with any type. This C++ book will guide you in fully exploiting standard containers and algorithms, understanding how to pick the appropriate one for each problem. By the end of this book, you will not only be able to write efficient code but also be equipped to improve the readability, performance, and maintainability of your programs.
Table of Contents (9 chapters)
C++ Fundamentals

Algorithms Provided by the C++ Standard Template Library

Algorithms are a way to operate on containers in an abstract way.

The C++ standard library provides a wide range of algorithms for all the common operations that can be performed on ranges of elements.

Because algorithms accept iterators, they can operate on any container, even user-defined containers, as long as they provide iterators.

This allows us to have a large number of algorithms that work with a large number of containers, without the need for the algorithm to know how the container is implemented.

The following are some of the most important and common algorithms that are provided by the STL.


Algorithms operate on ranges, so they normally take a pair of iterators: first and last.


Most of the algorithms accept a unary or binary predicate: a Functor (function object), which accepts either one or two parameters. These predicates allow the user to specify some of the actions that the algorithm requires. What the actions are...