title: Brute force implementation for 0-1 Knapsack
body: <p>I'm struggling with the given task for almost a week without success of finding solution so this site is my last hope.</p>
  
  <p>I have <a href="http://en.wikipedia.org/wiki/Knapsack_problem#0-1_knapsack_problem" rel="nofollow">0-1 Knapsack</a> problem which has 20 items with different values and weights, maximum weight of sack is 524. Now i need to implement brute force to find optimal solution subset of 20 items so that total weights &lt;= 524 and maximum values of chosen items.</p>
  
  <p>Could you please point me out or better give detailed implementation to analyze how it work!!
  Thank you very much  </p>