Asher The King

 Profile Answers by Asher The King 

• Jul 10th, 2011

 

int sum=0;
For (int i=0;i<Line;i++)
    For(int j=0;j<COL;j++)
    {
         //Primary diagonal
         if(i==j )sum += A[i][j];
         //Secondary diagonal
         if(i==(COL-j))sum += A[i][j];
     }

Ashima

• Aug 9th, 2012

 

Assuming the matrix size is row, col and i represents the row and j represents the col.
Get the primary Diagonal where i==j and secondary diagonal where i==j-1.
Below is the code for that.

Code
span style="font-style: italic;">//Primary diagonal//Secondary diagonal

JosephVP

• Jul 24th, 2014

 

As it is a Square Matrix, we can do with single Loop, Please follow the below algorithm.

Code
span style="color: #ff0000;">"Primary Total Is : "+sumValuePrimary+", Secondary Left Total Is : "+sumValueSecondaryLeft+", Secondary Right Total Is : "+sumValueSecondaryRight);


        }

hema

• Jan 3rd, 2015

 

Code
span style="color: #006699;">testCode" Primary diagonal sum ="" Secondary diagonal sum =" + secondaryDiagonalSum);


        }


        }


 

hema

• Jan 3rd, 2015

 

Tested Java code

Code
span style="color: #006699;">testCode" Primary diagonal sum ="" Secondary diagonal sum =" + secondaryDiagonalSum);


        }


        }


 

Kavya oleti

• Jan 22nd, 2017

 

If it is a square matrix order n
Primary diagonal
if(i==j)
{
sum+=a[i][j];
}
Secondary diagonal
if(i==(n-1)-j)
{
sum+=a[i][j];
}