Question
Program to sort non-boundary elements of matrix in descending order .
Matrix = [5, 2, 9, 8, 7]
[9, 6, 4, 2, 3]
[3, 8, 1, 3, 9]
[1, 2, 3, 4, 5]
SORTED MATRIX
[5, 2, 9, 8, 7]
[9, 8, 6, 4, 3]
[3, 3, 2, 1, 9]
[1, 2, 3, 4, 5]
Share code with your friends
Share on whatsapp
Share on facebook
Share on twitter
Share on telegram
Code
import java.util.Scanner;
public class SortNonBoundaryElementsOfMatrix
{
public static void main(String[] args)
{
int row=0,col=0,i=0,j=0,k=0,temp=0,count=0;
int arr[][],b[];
Scanner sc=new Scanner(System.in);
System.out.println("ENTER THE NUMBER OF ROW OF MATRIX");
row=sc.nextInt();
System.out.println("ENTER THE NUMBER OF COLUMN OF MATRIX");
col=sc.nextInt();
arr=new int[row][col];
System.out.println("ENTER THE ELEMENTS IN MATRIX");
for(i=0;i< row;i++)
{
for(j=0;j< col;j++)
{
arr[i][j]=sc.nextInt();
/*counting the number of non-boundary elements*/
if(i!=0&&i!=(row-1)&&j!=0&&j!=(col-1))
{
count++;
}
}
}
b=new int[count];
System.out.println("ORIGINAL MATRIX");
for(i=0;i< row;i++)
{
for(j=0;j< col;j++)
{
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
for(i=0;i< row;i++)
{
for(j=0;j< col;j++)
{
if(i!=0 &&j!=0&&i!=(row-1)&&j!=(col-1))
{
b[k]=arr[i][j];
k++;
}
}
}
/*sorting one-dimensional array*/
for(i=0;i< b.length;i++)
{
for(j=0;j< b.length;j++)
{
if(b[i] > b[j])
{
temp=b[i];
b[i]=b[j];
b[j]=temp;
}
}
}
k=0;
for(i=0;i< row;i++)
{
for(j=0;j< col;j++)
{
if(i!=0 &&j!=0&&i!=(row-1)&&j!=(col-1))
{
arr[i][j]=b[k];
k++;
}
}
}
System.out.println("SORTED MATRIX");
for(i=0;i< row;i++)
{
for(j=0;j< col;j++)
{
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
}
}
Coding Store
Sale

ISC QUESTION PAPERS WITH SOLUTION(PROGRAMMING ONLY)
Sale

ICSE QUESTION PAPER WITH SOLUTION(PROGRAMMING ONLY)
Sale

ISC QUESTION PAPERS WITH SOLUTION(PROGRAMMING ONLY)
Sale

ICSE QUESTION PAPER WITH SOLUTION(PROGRAMMING ONLY)
Sale

ISC QUESTION PAPERS WITH SOLUTION(PROGRAMMING ONLY)
Sale
