Knapsack problem

-
#include<stdio.h>
void kanpsack(int ,int[],int[],int);
int max(int,int);
int main()
{
 int capacity,n;
 printf("enter the number of items:");
 scanf("%d",&n);
 int weights[n],profits[n];
 printf("enter weights the of items:");
 for(int i=0;i<n;i++)
 {
  scanf("%d",&weights[i]);
 }
 printf("enter profits the of items:");
 for(int i=0;i<n;i++)
 {
  scanf("%d",&profits[i]);
 }
 printf("enter the capacity of knapsack:");
 scanf("%d",&capacity);
 kanpsack(n,weights,profits,capacity);
 return 0;
}
void kanpsack(int n,int weights[],int profits[],int capacity)
{
 int dp[n+1][capacity+1];
 for(int i=0;i<=n;i++)
 {
  for(int w=0;w<=capacity;w++)
  {
   if(i==0||w==0)
   {
    dp[i][w]=0;
   }
   else if(weights[i-1]<=w)
   {
    dp[i][w] = max(profits[i - 1] + dp[i - 1][w - weights[i - 1]], dp[i - 1][w]);
   }
   else
   {
    dp[i][w]=dp[i-1][w];
   }
  }
 }
 printf("max profit is :%d",dp[n][capacity]);
 int w=capacity;
 printf("\nitems included in the knapsack:");
 for(int i=n;i>0&&w>0;i--)
 {
  if(dp[i][w]!=dp[i-1][w])
  {
   printf("%d ",i);
   w-=weights[i-1];
  }
 }
 printf("\n");
}
int max(int a,int b)
{
 return(a>b)?a:b;
}

Comments

Post a Comment

Popular posts from this blog

AVL Trees

-
#include <stdio.h> #include <stdlib.h> // Structure to represent a node in the AVL tree struct Node {     int key;     struct Node* left;     struct Node* right;     int height; }; // Function to get the height of the node int height(struct Node* N) {     if (N == NULL)         return 0;     return N->height; } // Function to get the maximum of two integers int max(int a, int b) {     return (a > b) ? a : b; } // Helper function that allocates a new node with the given key struct Node* newNode(int key) {     struct Node* node = (struct Node*)malloc(sizeof(struct Node));     node->key = key;     node->left = NULL;     node->right = NULL;     node->height = 1; // New node is initially added at leaf     return(node); } // Right rotate subtree rooted with y struct Node* rightRotate(struct Node* y) {     ...
Read more

BFS Matrix

-
#include<stdio.h> #include<stdlib.h> #define MAX 100 #define initial 1 #define waiting 2 #define visited 3 int adj[MAX][MAX];   int state[MAX];      int queue[MAX], front = -1, rear = -1;  void create_graph(int n, int gtype); void BF_Traversal(int n); void BFS(int v, int n); void insert_queue(int vertex); int delete_queue(); int isEmpty_queue(); int main() {     int n, gtype;          printf("Enter 1 for undirected graph and -1 for directed graph: ");     scanf("%d", &gtype);     printf("Enter the number of vertices: ");     scanf("%d", &n);          create_graph(n, gtype);          BF_Traversal(n);          return 0; } void create_graph(int n, int gtype) {     int max_edges, src, dest;          if (gtype == 1)         max_edges = (n * (n - 1)) /...
Read more

BFS List

-
#include<stdio.h> #include<stdlib.h> #define MAX 100 #define initial 1 #define waiting 2 #define visited 3 struct Node { int vertex; struct Node* next; }; int queue[MAX],front=-1,rear=-1; int state[MAX]; struct Node* adj[MAX]; void create_graph(int n,int gtype); void insert_queue(int v); int delete_queue(); int isEmpty_queue(); void BFT(int n); void BFS(int start,int n); void add_edge(int src,int dest); struct Node* create_node(int v); int main() { int gtype,n; printf("Enter 1 for undirected graph and -1 for directed graph:"); scanf("%d",&gtype); printf("Enter the number of vertices:"); scanf("%d",&n); create_graph(n,gtype); BFT(n); return 0; } void create_graph(int n,int gtype) { int max_edges,src,dest; if(gtype==1) max_edges=(n*(n-1))/2; else if(gtype==-1) max_edges=(n*(n-1)); for(int i=0;i<n;i++) adj[i]=NULL; for(int i=0;i<max_edges;i++) { printf("Enter edge %d (press -1 and -1 to quit):...
Read more