Scribd
Upload
16 views1 page

Experiment 5 Aim-: Code-:: Write A Program To Solve Knapsack Problem Using Greedy Approach

egfv

Uploaded by

Gopichandu Maguluri
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
16 views1 page

Experiment 5 Aim-: Code-:: Write A Program To Solve Knapsack Problem Using Greedy Approach

egfv

Uploaded by

Gopichandu Maguluri
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Experiment 5

Aim-: Write a program to solve knapsack problem using greedy approach.


Code-:
#include <stdio.h>
struct Item {int value;int weight;};
void swap(struct Item* a, struct Item* b) {
struct Item temp = *a;
*a = *b;*b = temp;}
void sortItems(struct Item arr[], int n) {
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < n - i - 1; j++) {
double r1 = (double)arr[j].value / arr[j].weight;
double r2 = (double)arr[j + 1].value / arr[j + 1].weight;
if (r1 < r2) {
swap(&arr[j], &arr[j + 1]); }}}}
double knapsack(int W, struct Item arr[], int n) {
sortItems(arr, n);int curWeight = 0;
double finalValue = 0.0;
for (int i = 0; i < n; i++) {
if (curWeight + arr[i].weight <= W) {
curWeight += arr[i].weight;
finalValue += arr[i].value;
} else {int remain = W - curWeight;
finalValue += arr[i].value * ((double)remain / arr[i].weight);
break;}}return finalValue;
} int main() {
int W = 50;
struct Item arr[] = {{60, 10}, {100, 20}, {120, 30}};
int n = sizeof(arr) / sizeof(arr[0]);
printf("Maximum value we can obtain = %.2f\n", knapsack(W, arr, n));
return 0;
}

Output:-

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy