Solving the popular NP problem, The Subset Sum Problem, with an Amortized O(n) algorithm based on Recursive Backtracking. The Algorithm stood second fastest in the organized Intra-University competition.
algorithms
competitive-programming
backtracking-algorithm
subset-sum
algorithms-and-data-structures
subset-sum-solver
np-problem
-
Updated
Oct 8, 2021 - C