addition of combinations of two-dimensional array list

If the 2 is fixed then the easiest thing I can think about is just generating the new array with N*(N-1)/2 rows, one for each sum and then using two variables to iterate through the original array with something like:s

int c = 0;
for (int i = 0; i < N; i++) {
  for (int j = i + 1; j < N; j++) {
    for (int k = 0; k < M; k++) {
      sums[c][k] = AoA[i][k] + AoA[j][k];
    }
    c++;
  }
}

Leave a Comment