Computer Science‎ > ‎

Algorithms: Dynamic Programming - The Integer Knapsack Problem with C Program Source Code







Given n items of weight wi and value vi, find the items that should be taken such that the weight is less than the maximum weight W and the corresponding total value is maximum. This problem exhibits both overlapping subproblems and optimal substructure and is therefore a good candidate for dynamic programming.

Complexity:

Time complexity is O(n*W), where n is the total number of items and W is the maximum weight.

Complete Tutorial with Examples :



Integer Knapsack Problem - C Program Source Code

#include<stdio.h>
int max(int a,int b)
{
       
return a>b?a:b;
}
int Knapsack(int items,int weight[],int value[],int maxWeight)
{
       
int dp[items+1][maxWeight+1];
       
/* dp[i][w] represents maximum value that can be attained if the maximum weight is w and
           items are chosen from 1...i */

       
/* dp[0][w] = 0 for all w because we have chosen 0 items */
       
int iter,w;
       
for(iter=0;iter<=maxWeight;iter++)
       
{
                dp
[0][iter]=0;
       
}
       
/* dp[i][0] = 0 for all w because maximum weight we can take is 0 */
       
for(iter=0;iter<=items;iter++)
       
{
                dp
[iter][0]=0;
       
}
       
for(iter=1;iter<=items;iter++)
       
{
               
for(w=0;w<=maxWeight;w++)
               
{
                        dp
[iter][w] = dp[iter-1][w]; /* If I do not take this item */
                       
if(w-weight[iter] >=0)
                       
{
                               
/* suppose if I take this item */
                                dp
[iter][w] = max(dp[iter][w] , dp[iter-1][w-weight[iter]]+value[iter]);
                       
}
               
}

       
}
       
return dp[items][maxWeight];
}
int main()
{
       
int items;
        scanf
("%d",&items);
       
int weight[items+1],value[items+1];
       
int iter;
       
for(iter=1;iter<=items;iter++)
       
{
                scanf
("%d%d",&weight[iter],&value[iter]);
       
}
       
int maxWeight;
        scanf
("%d",&maxWeight);
        printf
("Max value attained can be %d\n",Knapsack(items,weight,value,maxWeight));
}

Rough notes about the Algorithm - as implemented in the code above:

Firstly, input the total number of items, the weight and value of each item. Then input the
maximum weight (maxWeight). Lastly calculate the maximum value that can be attained using
Knapsack function.

Knapsack function – This function takes total number of items (items), weight of all the items
(weight), value of all the items (value) and the maximum weight (maxWeight) as arguments. It
returns the maximum value that can be attained.

Declare dp[items+1][maxWeight+1]. Where, dp[i][w] represents maximum value that can be attained if the maximum weight is w and items are chosen from 1...i.
dp[0][w] = 0 for all w because we have chosen 0 items. And, dp[i][0] = 0 for all w because maximum weight we can take is 0.
Recurrence: 
for i=1 to items
    for w=0 to maxWeight
        dp[i][w] = dp[i-1][w], if we do not tale item i. if w-weight[i] >=0, suppose we take this
        item then, dp[i][w] = max(dp[i][w] , dp[i-1][w-weight[i]]+value[i]). Where, max is a
        function that returns the maximum of the two arguments it takes.
     next
next
Return dp[items][maxWeight]
Related Tutorials (common examples of Dynamic Programming):

 Integer Knapsack problem

 An elementary problem, often used to introduce the concept of dynamic programming.
 Matrix Chain Multiplication

 Given a long chain of matrices of various sizes, how do you parenthesize them for the purpose of multiplication - how do you chose which ones to start multiplying first?

 Longest Common Subsequence 

 Given two strings, find the longest common sub sequence between them.


Some Important Data Structures and Algorithms, at a glance:

Arrays : Popular Sorting and Searching Algorithms

 

  

Bubble Sort  

Insertion Sort 

Selection Sort Shell Sort

Merge Sort  

Quick Sort 

 
Heap Sort
 
Binary Search Algorithm

Basic Data Structures  and Operations on them


  

Stacks 

Queues  

 
 Single Linked List 

Double Linked List

Circular Linked List 
















Basic Data Structures and Algorithms



Sorting- at a glance

 Bubble Sort One of the most elementary sorting algorithms to implement - and also very inefficient. Runs in quadratic time. A good starting point to understand sorting in general, before moving on to more advanced techniques and algorithms. A general idea of how the algorithm works and a the code for a C program.

Insertion Sort - Another quadratic time sorting algorithm - an example of dynamic programming. An explanation and step through of how the algorithm works, as well as the source code for a C program which performs insertion sort.

Selection Sort - Another quadratic time sorting algorithm - an example of a greedy algorithm. An explanation and step through of how the algorithm works, as well as the source code for a C program which performs selection sort.

Shell Sort- An inefficient but interesting algorithm, the complexity of which is not exactly known.

Merge Sort An example of a Divide and Conquer algorithm. Works in O(n log n) time. The memory complexity for this is a bit of a disadvantage.

Quick Sort In the average case, this works in O(n log n) time. No additional memory overhead - so this is better than merge sort in this regard. A partition element is selected, the array is restructured such that all elements greater or less than the partition are on opposite sides of the partition. These two parts of the array are then sorted recursively.

Heap Sort- Efficient sorting algorithm which runs in O(n log n) time. Uses the Heap data structure.

Binary Search Algorithm- Commonly used algorithm used to find the position of an element in a sorted array. Runs in O(log n) time.

Basic Data Structures and Algorithms


 Stacks Last In First Out data structures ( LIFO ). Like a stack of cards from which you pick up the one on the top ( which is the last one to be placed on top of the stack ). Documentation of the various operations and the stages a stack passes through when elements are inserted or deleted. C program to help you get an idea of how a stack is implemented in code.

Queues First in First Out data structure (FIFO). Like people waiting to buy tickets in a queue - the first one to stand in the queue, gets the ticket first and gets to leave the queue first. Documentation of the various operations and the stages a queue passes through as elements are inserted or deleted. C Program source code to help you get an idea of how a queue is implemented in code.

Single Linked List A self referential data structure. A list of elements, with a head and a tail; each element points to another of its own kind.

Double Linked List- A self referential data structure. A list of elements, with a head and a tail; each element points to another of its own kind in front of it, as well as another of its own kind, which happens to be behind it in the sequence.

Circular Linked List Linked list with no head and tail - elements point to each other in a circular fashion.

 Binary Search Trees A basic form of tree data structures. Inserting and deleting elements in them. Different kind of binary tree traversal algorithms.

 Heaps A tree like data structure where every element is lesser (or greater) than the one above it. Heap formation, sorting using heaps in O(n log n) time.

 Height Balanced Trees - Ensuring that trees remain balanced to optimize complexity of operations which are performed on them.

Graphs

 Depth First Search - Traversing through a graph using Depth First Search in which unvisited neighbors of the current vertex are pushed into a stack and visited in that order.

Breadth First Search - Traversing through a graph using Breadth First Search in which unvisited neighbors of the current vertex are pushed into a queue and then visited in that order.

Minimum Spanning Trees: Kruskal Algorithm- Finding the Minimum Spanning Tree using the Kruskal Algorithm which is a greedy technique. Introducing the concept of Union Find.

Minumum Spanning Trees: Prim's Algorithm- Finding the Minimum Spanning Tree using the Prim's Algorithm.

Dijkstra Algorithm for Shortest Paths- Popular algorithm for finding shortest paths : Dijkstra Algorithm.

Floyd Warshall Algorithm for Shortest Paths- All the all shortest path algorithm: Floyd Warshall Algorithm

Bellman Ford Algorithm - Another common shortest path algorithm : Bellman Ford Algorithm.

Dynamic Programming A technique used to solve optimization problems, based on identifying and solving sub-parts of a problem first.

Integer Knapsack problemAn elementary problem, often used to introduce the concept of dynamic programming.

Matrix Chain Multiplication Given a long chain of matrices of various sizes, how do you parenthesize them for the purpose of multiplication - how do you chose which ones to start multiplying first?

Longest Common Subsequence Given two strings, find the longest common sub sequence between them.

 Elementary cases : Fractional Knapsack Problem, Task Scheduling - Elementary problems in Greedy algorithms - Fractional Knapsack, Task Scheduling. Along with C Program source code.

Data Compression using Huffman TreesCompression using Huffman Trees. A greedy technique for encoding information.