A Faster Pseudopolynomial Time Algorithm for Subset Sum http://arxiv.org/pdf/1507.02318v1.pdf
-
Updated
Jan 23, 2016 - Java
A Faster Pseudopolynomial Time Algorithm for Subset Sum http://arxiv.org/pdf/1507.02318v1.pdf
This is an implementation of the Sub Set Sum Backtracking algorithm in C. The algorithm is used to find a subset of a given set of numbers that adds up to a given sum. The algorithm is implemented using backtracking.
Add a description, image, and links to the subsetsum topic page so that developers can more easily learn about it.
To associate your repository with the subsetsum topic, visit your repo's landing page and select "manage topics."