21. Knapsack Problem using Greedy method.

[@satyamrajsingh7378]

I have watched all the different lectures on this topic in youtube, but this is the best one

[@CSEGURUS]

Thank you @Satyam Raj

[@skl7714]

Literally the best !!! Tqqq

[@shareefsk2314]

Really u helped me alot daily

[@shareefsk2314]

U r the best sir

[@CSEGURUS]

Thank u> Keep learning.

[@shareefsk2314]

Pls do more videos on daa

[@CSEGURUS]

yea i vl do by March ending .

[@kurmapuhymavathi2089]

i=3 calculate chesinappudu x[3]=0.277 vochindhi sir...

[@vaishnavivallala3247]

i=2 ayipoyaka u=0 avtadi kada endukante akkada knapsack full ayipotadi ga i=2 ayipoyaka , so i=3 calculation lo u=0 teeskunte first IF lo break avutadi second IF lo x[3]=0 avutadi.

the algorithm doesn't make any sense