11
Fundamental Algorithms and Searching
This chapter covers some of the most crucial and commonly used C++ Standard Template Library (STL) algorithms. The chapter equips readers with the knowledge and skills to manipulate and analyze data effectively by focusing on sorting, conditional checks, finding, and searching techniques. Understanding these fundamental algorithms is paramount for developers keen on ensuring efficient and robust applications. The chapter also emphasizes best practices, ensuring code is correct and optimized.
This chapter covers the following main topics:
- Sorting
- Checking conditions
- Counting and finding
- Searching and comparison
- Best practices
Technical requirements
The code in this chapter can be found on GitHub:
https://github.com/PacktPublishing/Data-Structures-and-Algorithms-with-the-CPP-STL ...
Get Data Structures and Algorithms with the C++ STL now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
