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

So far, we have explored a variety of common programming structures and paradigms. Now, we are going to delve into several techniques that expand on the topics we discussed previously, beginning with an assortment of advanced graph problems, and then shifting focus toward the expansive subject of dynamic programming.

In this chapter, we will discuss three well-known algorithms, namely the Bellman-Ford algorithm, Johnson's algorithm, and Kosaraju's algorithm. All of these algorithms share clear similarities with ones we have already covered in this book but extend and combine them in various ways to solve potentially complex problems with much greater efficiency than suboptimal implementations would allow. In addition to learning these specific techniques, this chapter should also increase your general familiarity with the use of fundamental graph-related techniques and provide greater insight into how those fundamentals can be applied to a diverse range of different...