C++ Beginner · Lesson 07 of 8
Standard algorithms
sort, find, transform, accumulate, lambdas as predicates.
Estimated time · 4h
Guided lesson
Work through these steps
- 1.
Read the standard algorithms example and identify what each line owns or changes.
- 2.
Create a small source file, compile with warnings enabled, and run it from the terminal.
- 3.
Change one input, predict the result before running, then compare the output.
- 4.
Record one compiler or runtime error and explain the correction in your own words.
Example
Try it yourself
std::sort(samples.begin(), samples.end());
auto unsafe = std::find_if(samples.begin(), samples.end(),
[](double value) { return value > 80.0; });Practical exercise
Apply the lesson
Build a small robotics-flavoured program that demonstrates standard algorithms. Keep the first version simple, compile with -Wall -Wextra, and test one normal and one edge case.
Before you continue
- The program builds without warnings
- You can explain the key rule without reading the example
- The normal and edge cases both have recorded results