Knapsack Problem using Greedy Technique Example2 Method 1 | Lec 49 | Design & Analysis of Algorithm

[@poojapoojadhapte1430]

Understood same way in our lecture also thought but didnt understood mam now understood

[@BIKRAMKUMAR-jb4lk]

Mam good explain

[@thrishulant1]

Great thank you for teaching

[@nakkasai6924]

14

[@ujeth9998]

2

[@s.nithishkumarreddy4095]

2

[@poojapoojadhapte1430]

Mam we shouldcheck weight is lesser than profit

[@mandadirohitreddy8086]

Good explanation mam

[@poojabagalkot2901]

Y x is equal to 1 ?

[@souryyapharas9097]

What if we do in 0/1 knapsack using dynamic programming

[@cseguru]

Check complete playlist

[@rishikhandelwal5467]

What is optimal solution

[@prajwalr9635]

Can u make video on construction of HUFFAMAN CODE

[@GopiChandan-t5t]

Mam what if x equal to m then wt we need to do in this case

[@sadhanasinghpatel3798]

Thank you so much ma'am ❤

[@yup-h6r]

2-3*0.67 is -0.01 right how did you got 0?

[@LearnwithC]

Its approximately 0.01 ~~0

[@Incyislive]

14 less than 2??

[@cseguru]

2

[@chandunavyasree6804]

Step:3 was little bit confusing

[@This_truly_is_evil_era]

😂

[@venugopal-di7uh]

14 is greater than 2

[@Mridulmishra06]

Thnku mam

[@haringowda]

Thank you so much mam

[@niraj.suryavanshi_]

Is this poojitha Mam ?

[@cseguru]

No

[@mdwasimshekh2009]

Pta hai aaplogo ke video me views nhi aata kyunki jyada angrez bante hai isliye

[@anujkumbhar6216]

Thank you 🙏 so much mam