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

In the previous chapter, we discussed the divide-and-conquer algorithm design technique, which solves a given problem by dividing the input into smaller subproblems, solving each subproblem, and subsequently merging the results. Continuing our theme of algorithm design paradigms, we will now look at our next topic: the greedy approach.

On each iteration, a greedy algorithm is one that picks the 'seemingly best' alternative. In other words, a greedy solution to a problem composes a globally optimal solution to the given problem from a series of locally optimal solutions. For example, the following screenshot shows the shortest path that a car can take from Dulles International Airport in Washington DC to an office building in East Riverdale. Naturally, the path shown is also the shortest for any two points on the path that are not the starting and ending points:

Figure 5.1: A route from an airport to an office in Washington DC (Source: project-osrm.org)
Figure 5.1: A route from an airport to an office in Washington DC (Source: project-osrm...