Number Subsets Calculator in Java (Applet using AWT)
Submitted by onyx_ash08 on Wednesday, April 25, 2012 - 10:18.
Language
Guys, here is a problem given to us by our professor during our class in Object-Oriented Programming. Here, I used the AWT library of Java to design the interface.
Problem: Given an array containing some integers (there may be duplicates), write a routine or method that returns all the possible sums that can be formed by using numbers in the array. For instance, if the array contains 4 and 6, the possible sums are n0, 4, 6, and 10. If the array contains 1, 3, 5, and 7, the possible sums are 0, 1, 3, 5, 7, 4, 6, 8, 8, 10, 12, 9, 11, 13, 15, and 16. Notice that 8 appears twice in the answer (1+7 and 3+5).
You can read more details of this tutorial in this link: http://www.eturo.co.cc/2012/01/tutorial-sum-of-all-possible-subsets-of.html
Note: Due to the size or complexity of this submission, the author has submitted it as a .zip file to shorten your download time. After downloading it, you will need a program like Winzip to decompress it.
Virus note: All files are scanned once-a-day by SourceCodester.com for viruses, but new viruses come out every day, so no prevention program can catch 100% of them.
FOR YOUR OWN SAFETY, PLEASE:
1. Re-scan downloaded files using your personal virus checker before using it.
2. NEVER, EVER run compiled files (.exe's, .ocx's, .dll's etc.)--only run source code.
Add new comment
- 65 views