Implement sum of diagonals (NxN)
Sigiloso
void calc_sums(int[][] arr, int size, out int sum1, out int sum2) { sum1 =0; sum2 =0; for (int i=0; i < size; i++) { for(int j =0; j < size; j++) { if( i == j) { sum1 += arr[i][j]; } else if ( i + j == (size -1)) { sum2 += arr[i][j]; } } } //linear solution: for (int i=0; i < n; i++) { sum1 += arr[i][i]; sum2 += arr[i][size -i -1]; } }