Abhishek Mishra(Problem - 4)

#include <bits/stdc++.h>
using namespace std;

int findMinRec(int arr[], int i, int sumCal, int sumT)
{

if (i == 0)
    return abs((sumT - sumCal) - sumCal);

return min(
    findMinRec(arr, i - 1, sumCal + arr[i - 1], sumT), findMinRec(arr, i - 1, sumCal, sumT));

}

int findMin(int arr[], int n)
{

int sumT = 0;
for (int i = 0; i < n; i++)
    sumT += arr[i];


return findMinRec(arr, n, 0, sumT);

}

int main()
{
int x;
cout<<"Enter Size of Array " << endl;
cin>>x;
int arr[x];
cout<< " Enter array element " <<endl;

for(int i = 0; i < x; i++)
  cin>>arr[i];
  
int n = sizeof(arr) / sizeof(arr[0]);
cout<< findMin(arr, x);

return 0;

}