int g(int i, int j) { int sum = 0; for (int k = min(i, j) + 1; k <= max(i, j); k = k + 1) sum = sum + a[k]; return sum; } Find a value mini ≠ j f(i, j). Probably by now Iahub already figured out the s
int g(int i, int j) { int sum = 0; for (int k = min(i, j) + 1; k <= max(i, j); k = k + 1) sum = sum + a[k]; return sum; } Find a value mini ≠ j f(i, j). Probably by now Iahub already figured out the solution to this problem. Can you? Input ...