The difference between maximum possible profit for 0/1 Knapsack and fractional Knapsack problem with capacity (W) = 20. Solution Given: I know how to do both the greedy and Dynamic programming. But i know only tabulation method,the solution above given shows some easy way to do it. don't know what shortcuts they used above. please suggest is there any easy way to other than tabulation method ?