CAN SOMEONE GIVE AN IN-DEPTH EXPLANATION OF WHAT'S HAPPENING IN THIS CODE LINE BY LINE ? // CPP program to find if we can get given // sum using elements of given array. #include using namespace std; // maximum size of x const int MAX = 1000; // to check whether x is possible or not int ispossible[MAX];

void check(int arr[], int N) { ispossible[0] = 1; sort(arr, arr + N);

for (int i = 0; i < N; ++i) { int val = arr[i]; // if it is already possible if (ispossible[val]) continue; // make 1 to all it's next elements for (int j = 0; j + val < MAX; ++j) if (ispossible[j]) ispossible[j + val] = 1; } }

// Driver code int main() { int arr[] = { 4,2 }; int N = sizeof(arr) / sizeof(arr[0]); check(arr, N); int x = 100; if (ispossible[x]) cout << x << " is possible."; else cout << x << " is not possible."; return 0; }