This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
for each number 'i' | |
create a new set which INCLUDES number 'i' if it does not exceed 'S', and recursively | |
process the remaining numbers | |
create a new set WITHOUT number 'i', and recursively process the remaining numbers | |
return true if any of the above two sets has a sum equal to 'S', otherwise return false |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment