2 D Array Sorting And Finding Maximum Minimum Value With Position

For Details of The Program: CLICK HERE

import java.io.*;

class Matrixmult

{

BufferedReader br=new BufferedReader(new InputStreamReader(System.in));

int arr[][];

int r,c,max,min,maxi,maxj,mini,minj,i,j,m,n;

public void take()throws Exception

{

boolean bool=true;

while(bool)

{

System.out.println("\nEnter the number of rows:"); 

r=Integer.parseInt(br.readLine()); 

System.out.println("\nEnter the number of columns:"); 

c=Integer.parseInt(br.readLine());

 if(r < 2 || c < 2 || r >20 || c > 20)

bool=true;

else

bool=false;

}

arr=new int[r][c];

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

{

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

{

System.out.println("\nEnter Value:");

arr[i][j]=Integer.parseInt(br.readLine());

}

}

max=arr[0][0];

min=arr[0][0];

maxi=0;

mini=0;

maxj=0;

minj=0;

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

{

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

{

if(arr[i][j]>max)

{

max=arr[i][j];

maxi=i;

maxj=j;

}

else if(arr[i][j]< min)

{

mini=i;

minj=j;

min=arr[i][j];

}

}

}

System.out.println("\nOriginal Array\n");

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

{

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

{

System.out.print(arr[i][j]+" ");

}

System.out.println();

} 

System.out.println("\nMaximum Value="+max); System.out.println("\nRow="+maxi); System.out.println("\nColumn="+maxj); System.out.println("\nMinimum Value="+min); System.out.println("\nRow="+mini); System.out.println("\nColumn="+minj); 

for(m=0;m< r;m++)

{

for(n=0;n< c;n++)

{

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

{

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

{

if(arr[m][n]< arr[i][j])

{

min=arr[m][n];

arr[m][n]=arr[i][j];

arr[i][j]=min;

}

}

}

}

}

System.out.println("\nSorted Array\n");

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

{

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

{

System.out.print(arr[i][j]+" ");

}

System.out.println();

} 

}

public static void main(String args[]) throws Exception {

Matrixmult ob=new Matrixmult();

ob.take();

}

}

2012 Computer Practical Paper: CLICK HERE