Subset Sum
Subset Sum
h>
subset[index] = arr[0];
findSubset(arr + 1, n - 1, index + 1, sum + arr[0],
target);
int main()
{
int n, d;
printf("Enter number of elements in set: ");
scanf("%d", &n);
int S[n];
printf("Enter %d positive integers:\n", n);
for (int i = 0; i < n; i++)
scanf("%d", &S[i]);
if (!found)
printf("No subset found with the given sum.\n");
return 0;
}