Optimizing Subset Sum: Complexity Challenges

Computational complexity and optimization are related. As space or time complexity decreases,

a program becomes more optimized for performance by either using less memory or taking less processing

power to run. For the subset sum project, I wouldn't say we fixed the time complexity

problem. We definitely improved upon the time complexity by allowing for early exits and

decreasing the overall number of subsets we had to store and check. Even though we improved

the average run-time for the subset sum problem, the worst-case time complexity is still

the same. Consider the case where the sum of all elements in *_data_ptr is larger

than the target, but every subset that is not the sum of all elements is less than the