I am reading Algorithm Design by Kleinberg-Tardos, in chapter 6 (page 269) it has the subset-sum algorithm and also the idea of proof of correctness.How exactly i could prov
