Skip to content
/ Subset-Sum-Finder-Dynamic-Programming Public

This Java program defines two functions, howSum and improvedHowSum, to find a combination of numbers that add up to a given target sum, using a simple recursive approach and a more efficient recursive approach with memoization, respectively.

3 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

danieldotwav/Subset-Sum-Finder-Dynamic-Programming

Error
Looks like something went wrong!

About

This Java program defines two functions, howSum and improvedHowSum, to find a combination of numbers that add up to a given target sum, using a simple recursive approach and a more efficient recursive approach with memoization, respectively.

Topics

java memoization recursion dynamic-programming combinatorial-optimization algorithm-complexity hashmap-java

Resources

Readme
Activity

Stars

3 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages