Knapsack Problem - Greedy Method Code Implementation in C | Analysis of Algorithm

#KnapsackProblemCode #FractionalKnapsackCode #EngineeringFrolic

Do like subscribe and share the video

[mdtahmid]

Simple and Perfect Explanation.
This Was Really Helpful.

[amanpandey]

You explained it in very simple way thank you brother❤

[abhranilray]

The best C code explanation video of Knapsack on YouTube.
Thank You Man❤‍🔥.

[sohinibhattacharjee]

Very helpful explanation sir... Understood everything properly.. Thanks you

[capa]

Not working for (check the soln bottom)
Profit - 25, 24, 15
Weight - 18, 15, 10
Output should be 31.5.. but it gives something else

#include<stdio.h>

void swap(float *xp, float *yp)
{
float temp;
temp = *xp;
*xp = *yp;
*yp = temp;
}
void knapsack(float *p, float *w, int n, int m){
int i;
float tp=0, d[20];

for(i=0;i<n;i++)
d[i]=0.0;

for(i=0;i<n;i++){
if(w[i]<=m){
d[i]=1;
tp=tp+p[i];
m=m-w[i];
}
else{
d[i]=m/w[i];
tp=tp+(d[i]*p[i]);
break;
}
}

for(i=0;i<n;i++)
printf("%f\t", d[i]);
printf("\nMAX PROFIT IS : %f", tp);
}
main()
{
int i, m, n, j;
float profit[10], weight[10], ratio[10];
printf("\nEnter no of elements :");
scanf("%d", &n);
printf("\nEnter profit and weight of product respectively\n");
for(i=0;i<n;i++){
printf("\nElement %d(PROFIT, WEIGHT ):", i+1);
scanf("%f\t %f", &profit[i], &weight[i]);
printf("\nprofit =%f, weight= %f", profit[i], weight[i]);

}
printf("\nCapacity of the knapsack :");
scanf("%d", &m);
for(i=0;i<n;i++){
for(j=i+1;j<n;j++){
if(ratio[j]>ratio[i]){
swap(&ratio[j], &ratio[i]);
swap(&profit[j], &profit[i]);
swap(&weight[j], &weight[i]);
}
}
}
knapsack(profit, weight, n, m);
}

[subhashkr]

Loved the explanation ❤..I am going to code in my PC

[anuragmeshram]

this is the best explanation, thank you

[arnabpramanik]

Thank you vaiya .Aisa video banate raho❤❤❤❤❤❤

[bhargobiroy]

In void knapsack why do you take j Sir?

[srijanpandey]

why dis it take 1 vector in the case of 10 p/w ratio when it can do 2

[kuberarale]

Great video.
Continue posting videos.

[ChillakuruMahan]

Bro you need to do u=0 when weight is greater than capacity

[yashpatel]

Sir this works for both fractional and o/1

[survipandey]

please don't post the code from next time because it's not working properly.