Write a program to declare a matrix A[ ][ ] of order (m*n) where 'm' is the number of rows and n is the number of columns such that both m...

Write a program to declare a matrix A[ ][ ] of order (m*n) where 'm' is the number of rows and n is the number of columns such that both m and n must be greater than 2 and less than 20.

Allow the user to input positive integers into this matrix. Perform the following tasks on the matrix:

1. Sort the elements of the outer row and column elements in ascending order using any standard sorting technique.
2. Calculate the sum of the outer row and column elements.
3. Output the original matrix, rearranged matrix, and only the boundary elements of the rearranged array with their sum.

Test your program for the following data and some random data.

Example 1

``````   INPUT : M=3, N=3
1    7   4
8    2   5
6    3   9
OUTPUT :
ORIGINAL MATRIX :
1    7   4
8    2   5
6    3   9

REARRANGED MATRIX :
1    3   4
9    2   5
8    7   6

BOUNDARY ELEMENTS :
1    3   4
9        5
8    7   6

SUM OF OUTER ROW AND OUTER COLUMN = 43
``````
``````import java.util.*;
class ISCprac2009q02{
public static void main(String args[])
throws InputMismatchException{
Scanner scan=new Scanner(System.in);

System.out.println("Enter the number of rows and columns(>2
and <20) : ");
int m=scan.nextInt();
int n=scan.nextInt();

if(m<2 || n<2 || m>20 || n>20)
System.out.println("Rows and columns should be more than 2
and less than 20.");
else{
int a[][]=new int[m][n];
int i,j,x,t,c;
System.out.println("Enter "+m*n+" elements for the matrix : ");
for(i=0;i< m;i++)
{
for(j=0;j< n;j++)
a[i][j]=scan.nextInt();
}
System.out.println("\nOriginal Matrix : ");
for(i=0;i< m;i++)
{
for(j=0;j< n;j++)
System.out.print(a[i][j]+" ");

System.out.println();
}

int b[]=new int[2*m+2*n-4];
x=0;
//STORE THE ELEMENTS OF THE OUTER ROW AND COLUMN
//IN A 1-D ARRAY
for(i=0;i< m;i++)
{
for(j=0;j< n;j++)
// CONDITION FOR BOUNDARY ELEMENTS
if(i==0 || j==0 || i==m-1 || j==n-1)
b[x++]=a[i][j];
}
//SORT THE 1-D ARRAY IN ASCENDING ORDER
for(i=0;i< x;i++)
{
for(j=i+1;j< x;j++)
{
if(b[i]>b[j])
{
t=b[i];
b[i]=b[j];
b[j]=t;
}
}
}

//PLACE THE SORTED ELEMENTS FROM 1-D
//ARRAY INTO THE 2-D ARRAY
c=0;
for(i=0;i< n;i++)
a[0][i]=b[c++];

for(i=1;i< m;i++)
a[i][n-1]=b[c++];

for(i=n-2;i>=0;i--)
a[m-1][i]=b[c++];

for(i=m-2;i> 0;i--)
a[i][0]=b[c++];

System.out.println("REARRANGED MATRIX : ");
for(i=0;i< m;i++)
{
for(j=0;j< n;j++)
System.out.print(a[i][j]+" ");

System.out.println();
}
System.out.println("BOUNDARY ELEMENTS : ");
for(i=0;i< m;i++)
{
for(j=0;j< n;j++)
if(i==0 || j==0 || i==m-1 || j==n-1)
System.out.print(a[i][j]+" ");
else
System.out.print("  ");
System.out.println();
}
}
}//end of main
}//end of class
``````