Created
April 8, 2013 14:26
-
-
Save vikashvverma/5337171 to your computer and use it in GitHub Desktop.
This program implements sum of subset algorithm in java... :D
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
import java.util.Scanner; | |
/** | |
* | |
* @author VIK VIKKU VIKASHVVERMA VIKASH | |
* @since April 8, 2013 | |
* @Website: http://vikash-thiswillgoaway.blogspot.com | |
* | |
*/ | |
public class SumOfSubsets { | |
int[] w; | |
int[] x; | |
int sum; | |
public void process() { | |
getData(); | |
} | |
private void getData() { | |
Scanner sc = new Scanner(System.in); | |
System.out.print("Enter the number of elements:"); | |
int n = sc.nextInt(); | |
w = new int[n + 1]; | |
x = new int[n + 1]; | |
int total = 0; | |
System.out.println("Enter " + n + " Elements :"); | |
for (int i = 1; i < n + 1; i++) { | |
w[i] = sc.nextInt(); | |
total += w[i]; | |
} | |
System.out.println("Enter the sum to be obtained: "); | |
sum = sc.nextInt(); | |
if (total < sum) { | |
System.out.println("Not possible to obtain the subset!!!"); | |
System.exit(1); | |
} | |
subset(0, 1, total); | |
} | |
private void subset(int s, int k, int r) { | |
int i = 0; | |
x[k] = 1; | |
if (s + w[k] == sum) { | |
System.out.println(); | |
for (i = 1; i <= k; i++) { | |
System.out.print("\t" + x[i]); | |
} | |
} else if ((s + w[k] + w[k + 1]) <= sum) { | |
subset(s + w[k], k + 1, r - w[k]); | |
} | |
if ((s + r - w[k]) >= sum && (s + w[k + 1]) <= sum) { | |
x[k] = 0; | |
subset(s, k + 1, r - w[k]); | |
} | |
} | |
public static void main(String[] args) { | |
new SumOfSubsets().process(); | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment