It is recommended to see result on mobile devices with strong wifi connection

Title in english, words not!

Can I get the code for the same? Nicely explained!!

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

nice video bro keep working hard

Nice

Thank you

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

Nice

Nice

Very Nice Explanation

Thank You

Very informative

Nice

Nicee

You explained it in very simple way thank you brother❤

Nice

Video Quality 1080p thev ...

Nice video 💯

On point useful video💯

Code plz

Helped alot appreciated bro 🙌

bekar ka samjhaya

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

Very informative

On campus easy hota na?

Thank you bro 😊

🔥🔥💯💯

thank you iam clearing exams successfully with your simple logics.....thank you

Finally I got a perfect vedio for job scheduling ..thank you so much 💜

🔥🔥💯💯

Nice

Nicee 🔥💯

🔥🔥❤️

🔥💯

Nice ❤️🔥

chanel deserve 1M suscribers

thanks;

Best Explanation!

Very nice

great👍

Nicee 💯🔥

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(" MAX PROFIT IS : %f",tp); } main() { int i,m,n,j; float profit[10],weight[10],ratio[10]; printf(" Enter no of elements :"); scanf("%d",&n); printf(" Enter profit and weight of product respectively "); for(i=0;i<n;i++){ printf(" Element %d(PROFIT , WEIGHT ):",i+1); scanf("%f\t %f",&profit[i],&weight[i]); printf(" profit =%f, weight= %f",profit[i],weight[i]); ratio[i]=profit[i]/weight[i]; } printf(" Capacity 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); }

superb video... it's very helpful

NIce explanation....was very helpful

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

Thanks

Nicee 💯❤️

Amazing 🔥👏

very helpful..... appreciated 😄