Knapsack Problem using Branch and Bound method

0/1 Knapsack using Branch and Bound
Branch and bound is an algorithm design paradigm which is generally used for solving combinatorial optimization problems. These problems typically exponential in terms of time complexity and may require exploring all possible permutations in worst case. Branch and Bound solve these problems relatively quickly.
Branch and bound is very useful technique for searching a solution but in worst case, we need to fully calculate the entire tree. At best, we only need to fully calculate one path through the tree and prune the rest of it.
Let us consider below 0/1 Knapsack problem to understand Branch and Bound.
Given two integer arrays val[0..n-1] and wt[0..n-1] that represent values and weights associated with n items respectively. Find out the maximum value subset of val[] such that sum of the weights of this subset is smaller than or equal to Knapsack capacity W.

[@vijaragavanrajagobal2273]

Your way of teaching is better than book. Thank you mam

[@ware_wolf___]

I was searching for an video of explaining this problem for nearly 2 hrs... And i watched many videos of famous lecturers..... But i can say that no one taught this sum this crystal clear..... Thank you akka🙏🙏🙏🙏🙏🙏

[@malasrimalasri5894]

Your explanation is very clear thankyou ❤

[@VigneshSekar-n9d]

One doubt you explain me

[@rohinikirthish1372]

Very clear explanation mam,
Thank you 😊

[@viral_works_]

Superb explanation 🙏

[@KowsiBagavathiannan]

very good explanation mam. Thank you

[@HEMASRI-wn7he]

Thank you mam very clear explanation ❤

[@nikhily8646]

clearly understood thank u

[@vinothapriyadharshini7624]

Clear explanation TQ 🤗🤗🤗🤗

[@abishaabiya4382]

Thank you

[@SanjayKumarK-um5no]

Clear explanation tq mam 🥳

[@bharath8760]

Superb....kastama irukunu ninacha..but easy😁🪄🔥

[@subikshadhanu1705]

Sister algorithm ku innu nerayya vedios podunga n queen ford fulkerson huffman tree optimal binary search tree string concept podunga monday exam iruku

[@sanjanatelkar5783]

Super thanku 😊

[@dhanusha2005]

Sis optimal binary search tree poduga next monday kula

[@Nageshsingh.LSingh]

Thank you mam❤

[@Dhana...27-d5k]

Value /weight calculate panni atha ascending order arrange pananuma mam..

[@dee2004kkk]

yess

[@yuvrajandatul1618]

Nandri akka

[@laharicn8482]

If w= 2 and v= 5 v/w should be 2.5 or 3

[@VigneshSekar-n9d]

V2/w2 =6 eppudi vanthuchu

[@vinothini8241]

🤙🏻

[@vishnupriyaarulselvi299]

Thanks ka🥰🥰🥰🥰🥰🥰

[@mr10pro10]

W=10 epti vanthuthuga maam,

[@boomika2502]

question la kuduthuruka total weight capacity bro

[@mr10pro10]

@@boomika2502 ok ga...

[@parnikaanand4591]

Thank uu mam

[@VeerpalKaur-wv7hp]

Tnkew mam