C++ Data Structures and Algorithm Design Principles

C++ Data Structures and Algorithm Design Principles 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. (Limited-time offer)

Table of Contents

• Lists, Stacks, and Queues
• Trees, Heaps, and Graphs
• Hash Tables and Bloom Filters
• Divide and Conquer
• Greedy Algorithms
• Graph Algorithms I
• Graph Algorithms II
• Dynamic Programming I
• Dynamic Programming II

Download Free PDF / Read Online