How to solve Knapsack Problem using Exhaustive Search | Brute Force

We will be looking at this topic n subjects like Design and analysis of algorithm, graph theory and data structures.

Here in this video i shall cover step by step working procedure of sequential search and we shall look at the algorithm for it.

Go through the content and feel free to contact me through the following mail id.

Thank you.

[tanishqkushwaha]

One of the best and easy technique on YouTube

[vickzak]

good explanation sir, thank you sir, carry on sir

[nextleveltech]

Thanks a lot... You explained very well❤️🙏❤️

[jessy]

I have an exam tomorrow and I'm here exploring ur videos and realizing that my teacher told the same thing in the class which means she also watched ur videos😂😅

[vickzak]

again watching for exam 😅, helped a lot thanks a lot....

[supriyamolleti]

Here max weight will be given or taken by us

[Noah-]

So, this one is Exhaustive optimization not Exhaustive because you are chosing the optimal solution