Sign In Start Free Trial
Account

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Book Overview & Buying C++ Data Structures and Algorithm Design Principles
  • Table Of Contents Toc
C++ Data Structures and Algorithm Design Principles

C++ Data Structures and Algorithm Design Principles

By : John Carey, Anil Achary, Shreyans Doshi, Payas Rajan
2.3 (4)
close
close
C++ Data Structures and Algorithm Design Principles

C++ Data Structures and Algorithm Design Principles

2.3 (4)
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)
close
close

The Knapsack Problem(s)

In this section, we will discuss the standard knapsack problem, also known as the 0-1 knapsack problem, which is known to be NP-complete, and thereby does not allow us to have any polynomial-time solution. Then, we will turn our discussion toward a version of the knapsack problem called the fractional knapsack problem, which can be solved using a greedy approach. Our focus in this section is to demonstrate how even subtle differences between how a problem is defined can lead to large changes in the solution strategies.

The Knapsack Problem

Suppose you are given a set of objects, O = {O1, O2, …, On}, with each having a certain weight, Wi, and a value of Vi. You are also given a bag (or a knapsack) that can carry only a total weight of T units. Now, say you are tasked with finding out about a set of objects to keep in your bag so that the total weight is less than or equal to T, and the total value of the objects is the maximum it can possibly be.

A real-world example...

CONTINUE READING
83
Tech Concepts
36
Programming languages
73
Tech Tools
Icon Unlimited access to the largest independent learning library in tech of over 8,000 expert-authored tech books and videos.
Icon Innovative learning tools, including AI book assistants, code context explainers, and text-to-speech.
Icon 50+ new titles added per month and exclusive early access to books as they are being written.
C++ Data Structures and Algorithm Design Principles
notes
bookmark Notes and Bookmarks search Search in title playlist Add to playlist font-size Font size

Change the font size

margin-width Margin width

Change margin width

day-mode Day/Sepia/Night Modes

Change background colour

Close icon Search
Country selected

Close icon Your notes and bookmarks

Confirmation

Modal Close icon
claim successful

Buy this book with your credits?

Modal Close icon
Are you sure you want to buy this book with one of your credits?
Close
YES, BUY

Submit Your Feedback

Modal Close icon
Modal Close icon
Modal Close icon