Book review : Complete Guide to Standard C++ Algorithms

Book under review: A Complete Guide to Standard C++ Algorithms by Simon Toth

History of standard C++ algorithms

The history of standard C++ algorithms is characterized by a few notable milestones. The C++98 standard introduced most of the algorithms, but it was the C++11 standard that made algorithms more useful with the introduction of lambdas. Before lambdas, the time investment of writing a custom function object made the usefulness of algorithms dubious. The C++11 standard also introduced move semantics, which made algorithms more efficient by allowing them to move objects instead of copying them. The C++14 standard added a few new algorithms and made some existing ones more efficient. The C++17 standard added several new algorithms, including ones for generating random numbers and for finding adjacent elements that satisfy a predicate. Finally, the C++20 standard added several new algorithms, including ones for sorting and searching ranges, and for transforming and filtering ranges. Overall, the history of standard C++ algorithms is one of steady improvement and expansion, with each new standard adding new algorithms and making existing ones more efficient and useful.

Introduction

Chapter 1 of the book is an introduction to the C++ standard library and its algorithms. The author notes that while the C++ standard library is somewhat limited in its functionality, it provides a versatile toolkit of algorithms for data and number crunching. The author also emphasizes the importance of good familiarity with C++ standard algorithms for C++ developers, as it can save them a lot of effort and help avoid accidental bugs. The chapter goes on to provide a brief history of standard C++ algorithms, noting that the C++98 standard introduced most of the algorithms, but it was the C++11 standard that made algorithms more useful with the introduction of lambdas. Overall, the introduction sets the stage for the rest of the book by providing context and background information on the C++ standard library and its algorithms.

Algorithms

Algorithms are a set of procedures or rules that are followed in order to solve a particular problem or perform a particular task. In the context of programming, algorithms are sets of instructions that are used to solve specific problems or perform specific operations on data. The C++ standard library provides a wide range of algorithms that can be used for tasks such as sorting, searching, and manipulating data. These algorithms are designed to be efficient, reliable, and easy to use, and they can save programmers a lot of time and effort by providing pre-built solutions to common problems. This book is designed to provide a comprehensive guide to these algorithms, with a focus on examples and notable aspects of each algorithm, rather than a detailed reference guide.

Introduction to ranges

The C++20 standard introduced the Ranges library, which provides a new way of working with sequences of elements in C++. Ranges are a more modern and expressive way of working with sequences than iterators, which have been the primary way of working with sequences in C++ for many years. Ranges provide a more declarative and composable way of working with sequences, allowing programmers to express operations on sequences in a more natural and intuitive way. The chapter goes on to introduce the basic concepts of ranges, including the different types of ranges (input ranges, forward ranges, bidirectional ranges, etc.), and the different operations that can be performed on ranges (such as filtering, transforming, and sorting). Overall, the introduction to ranges provides a new and powerful way of working with sequences in C++, and is an important addition to the C++ standard library.

The views

Views are a new feature introduced in the C++20 standard that provide a way of composing ranges in a more efficient and expressive way. Views are essentially lightweight objects that represent a view of a range, and can be used to perform operations on the range without actually modifying it. Views are designed to be composable, meaning that they can be combined together to create more complex views that perform multiple operations on a range. The chapter goes on to introduce the different types of views that are available in the C++ standard library, including the keys and values views, which operate on ranges of pair-like elements, and the filter and transform views, which allow elements to be filtered or transformed based on a predicate or function. Overall, views provide a powerful and efficient way of working with ranges in C++, and are an important addition to the C++ standard library.

Bits of C++ theory

PDF: According to Text 3, Chapter 5 of the book is dedicated to "Bits of C++ theory". This chapter is designed to provide a deeper understanding of some of the fundamental concepts and features of the C++ programming language. The chapter covers a wide range of topics, including templates, type deduction, move semantics, and the C++ memory model. The chapter is intended to be a more theoretical and in-depth exploration of these topics, rather than a practical guide to using them in code. By understanding these fundamental concepts, programmers can gain a deeper understanding of how the C++ language works, and can use this knowledge to write more efficient and effective code. Overall, the "Bits of C++ theory" chapter is an important resource for programmers who want to gain a deeper understanding of the C++ language and its features.

What makes this guide different from a reference guide?

This guide is different from a reference guide in that it is designed to be a "complete guide" to the C++ standard algorithms, rather than a comprehensive reference. The guide is intended to be read in sequential order, like a book, and focuses on providing examples and pointing out notable, surprising, dangerous, or interesting aspects of the different algorithms, rather than describing every detail. The guide is also written in a more approachable and conversational style, with the goal of making the material more accessible to a wider audience. Additionally, the guide includes chapters on more theoretical topics, such as "Bits of C++ theory", which provide a deeper understanding of the fundamental concepts and features of the C++ language. Overall, the guide is designed to be a more practical and readable resource for programmers who want to learn how to use the C++ standard algorithms effectively, rather than a comprehensive reference guide.

How does this guide approach teaching C++ algorithms?

This guide approaches teaching C++ algorithms by providing a "complete guide" to the C++ standard algorithms. The guide is designed to be read in sequential order, like a book, and focuses on providing examples and pointing out notable, surprising, dangerous, or interesting aspects of the different algorithms, rather than describing every detail. The guide is also written in a more approachable and conversational style, with the goal of making the material more accessible to a wider audience. Additionally, the guide includes chapters on more theoretical topics, such as "Bits of C++ theory", which provide a deeper understanding of the fundamental concepts and features of the C++ language. Overall, the guide is designed to be a practical and readable resource for programmers who want to learn how to use the C++ standard algorithms effectively.

Where can I obtain an original copy of this book?

There is no information on where to obtain a physical or digital copy of the book. However, the book is licensed under CC-BY-SA-NC, which means that it can be freely shared and distributed as long as it is not used for commercial purposes. The book can be accessed online for free at the hosting repository: https://github.com/HappyCerberus/book-cpp-algorithms.