gs gs122 Checksum Complexity Classes and NP-Complete Problems - Set Partition Problem - Quiz No.1

 #include <stdio.h> #include <stdbool.h> bool func1(int arr[], int n, int sum) { if (sum == 0) return true; if (n == 0 && sum != 0) return false; if (arr[n-1] > sum) return func1(arr, n-1, sum); return func1(arr, n-1, sum) || func1(arr, n-1, sum-arr[n-1]); } bool func (int arr[], int n) { int sum = 0; for (int i = 0; i < n; i++) sum += arr[i]; if (sum%2 != 0) return false; return func1 (arr, n, sum/2); } int main() { int arr[] = {4,6, 12, 2}; int n = sizeof(arr)/sizeof(arr[0]); if (func(arr, n) == true) printf("true"); else printf("false"); return 0; } 

 #include <stdio.h> bool func (int arr[], int n) { int sum = 0; int i, j; for (i = 0; i < n; i++) sum += arr[i]; if (sum%2 != 0) return false; bool partition[sum/2+1][n+1]; for (i = 0; i <= n; i++) partition[0][i] = true; for (i = 1; i <= sum/2; i++) partition[i][0] = false; for (i = 1; i <= sum/2; i++) { for (j = 1; j <= n; j++) { partition[i][j] = partition[i][j-1]; if (i >= arr[j-1]) partition[i][j] = partition[i][j] || partition[i - arr[j-1]][j-1]; } } return partition[sum/2][n]; } int main() { int arr[] = {3, 3, 4, 4, 7}; int n = sizeof(arr)/sizeof(arr[0]); if (func(arr, n) == true) printf("true"); else printf("false"); return 0; }