Book Image

C++ Data Structures and Algorithm Design Principles

By : John Carey, Anil Achary, Shreyans Doshi, Payas Rajan
Book Image

C++ Data Structures and Algorithm Design Principles

By: John Carey, Anil Achary, Shreyans Doshi, Payas Rajan

Overview of this book

C++ is a mature multi-paradigm programming language that enables you to write high-level code with a high degree of control over the hardware. Today, significant parts of software infrastructure, including databases, browsers, multimedia frameworks, and GUI toolkits, are written in C++. This book starts by introducing C++ data structures and how to store data using linked lists, arrays, stacks, and queues. In later chapters, the book explains the basic algorithm design paradigms, such as the greedy approach and the divide-and-conquer approach, which are used to solve a large variety of computational problems. Finally, you will learn the advanced technique of dynamic programming to develop optimized implementations of several algorithms discussed in the book. By the end of this book, you will have learned how to implement standard data structures and algorithms in efficient and scalable C++ 14 code.
Table of Contents (11 chapters)

Introduction

From the previous chapter, you should have a basic understanding of dynamic programming, as well as an effective set of strategies for finding a dynamic programming (DP) solution for an unfamiliar problem. In this chapter, we will develop this understanding further by exploring relationships between problems, particularly in terms of how the basic DP logic for one problem can be modified to find the approach to another. We will also discuss the concept of state space reduction, which allows us to exploit certain aspects of a problem to further optimize a working DP solution by decreasing the number of dimensions and/or operations required to find the result. We will conclude this chapter by revisiting the topic of graphs to demonstrate how the DP approach can be applied to the shortest-path problem.