Scribd
Upload
40 views4 pages

Java Matrix Sorting and Boundary Sum

The Java program prompts the user to input the dimensions of a matrix and its elements, validating that the dimensions are between 2 and 8. It calculates and displays the sum of the boundary elements of the matrix both before and after sorting the matrix elements in ascending order. The sorted matrix and the corresponding sums of the boundary elements are printed to the console.

Uploaded by

Shirsa Samanta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
40 views4 pages

Java Matrix Sorting and Boundary Sum

The Java program prompts the user to input the dimensions of a matrix and its elements, validating that the dimensions are between 2 and 8. It calculates and displays the sum of the boundary elements of the matrix both before and after sorting the matrix elements in ascending order. The sorted matrix and the corresponding sums of the boundary elements are printed to the console.

Uploaded by

Shirsa Samanta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

import [Link].

*;

class matrixsort

public static void main()

int M,N,i,j;

Scanner sc=new Scanner([Link]);

[Link]("M= ");

M=[Link]();

[Link]("N= ");

N=[Link]();

int A[][]=new int [M][N];

if(M<2 || M>8 || N<2 || N>8)

[Link]("INVALID INPUT" );

else

[Link]("ENTER THE ELEMENTS OF THE MATRIX ");

for(int i=0;i<M;i++)

for(int j=0;j<N;j++)

A[i][j]=[Link]();

[Link]("ORIGINAL MATRIX ");

for(int i=0;i<M;i++)

{
for(int j=0;j<N;j++)

[Link](A[i][j]+"\t");

[Link]();

int s=0;

for(int i=0;i<M;i++)

for(int j=0;j<N;j++)

if( i==0|| j==0||i==M-1||j==N-1)

s=s+A[i][j];

[Link]("SUM OF THE BOUNDARY ELEMENTS(UNSORTED)= "+s);

int tmp=0;

int arr[][]=new int[M*N];

for( int i=0;i<[Link];i++)

for(int j=0;j<[Link]-1;j++)

arr[tmp]=A[i][j];

tmp++;

}
for(int i=tmp;i>0;i--)

for(int j=tmp-1;i>0;j--)

if(arr[j+1]>arr[j])

int tmp=arr[j+1];

arr[j+1]=arr[j];

arr[j]=tmp;

int tmp=0;

for(int i=0;i<M;i++)

for(int j=0;j<N;j++)

A[i][j]=arr[t];

t++;

[Link]("SORTED MATRIX ");

for(int i=0;i<M;i++)

for(int j=0;j<N;j++)

[Link](A[i][j]+"\t");

}
[Link]();

int sum=0;

for(i=0;i<M;i++)

for( j=0;j<N;j++)

if(i==0||j==0||i==M-1||j==N-1)

sum=sum+A[i][j];

[Link]("SUM OF THE BOUNDARY ELEMENTS(SORTED)= "+sum);

You might also like