proof of correctness for greedy knapsack algorithm
-
05-11-2019 - |
题
I don't really understand why is statement 1 ≥ statement 2 in the attached picture. From what I understand the negative term in statement 2 must be greater than or equal the negative term in statement 1 if statement 1 ≥ statement 2 but I don't really know how. Any help on this matter will be really appreciated. Thanks!
Statement 1 and Statement 2 refers to the red highlighted boxes, from the attached picture, tagged as 1 and 2 respectively.
Original source: http://oucsace.cs.ohiou.edu/~razvan/courses/cs4040/lecture15.pdf
没有正确的解决方案
不隶属于 cs.stackexchange