CREATE OWN LIBRARY

A matrix contains one or more rows and columns. This program is to sort the row elements in descending order and to sort the columns in ascending order. Both the sorting is done on the original matrix.

Let the matrix be:

The matrix A is a 2×2 matrix, i.e. the matrix has two rows and two columns. Now, the individual row elements would be sorted in descending order and the individual column elements would be sorted in ascending order.

We can use any sorting technique like bubble sort, selection sort to sort the elements row wise or column wise. 

ROW SORTING:

For the first row, the two elements of the row will be compared. As, 12<15, so they are not in descending order, they will be swapped with each other. And the matrix will be:

Similarly, the elements of the 2nd row will be compared. Here also 10<20, which is not in descending order, it will also be swapped. So, after completing the sorting the matrix will be:

COLUMN SORTING:

For the first column, the two elements of the column will be compared. As, 12>10, they are not in ascending order, they will be swapped with each other. And the matrix will be:

Similarly, the elements of the 2nd column will be compared. Here 15<20 so, they are already in ascending order. They will not be swapped therefore, after the sorting the matrix will be:

Input: A matrix
OUTPUT: Matrix after sorting rows and columns

PROCESS:
Step 1: [Taking the inputs]
	Read m, n [the rows and columns of the matrix]
	For i=0 to m-1 repeat
		For j=0 to n-1 repeat
			Read a[i][j]
		[End of ‘for’ loop]
	[End of ‘for’ loop]
Step 2: [Sorting the rows and columns]
	[Sorting the rows in descending order]
for i=0 to m-1 repeat 
for j=0 to n-1 repeat 
for k=j+1 to n-1 repeat 
if a[i][j]<a[i][k] 
Set t<-a[i][j]
Set a[i][j]<-a[i][k]
Set a[i][k]<-t
				[End of ‘if’]
			[End of ‘for’ loop]
		[End of ‘for’ loop]
	[End of ‘for’ loop]
	[Displaying the matrix after sorting the rows]
	Print "After sorting the rows in descending order:"
	For i=0 to m-1 repeat 
		For j=0 to n-1 repeat
			Print a[i][j]
		[End of ‘for’ loop]
		Move to the next line
	[End of ‘for’ loop]
	[sorting the columns in ascending order]
	for j=0 to n-1 repeat 
		for i=0 to m-1 repeat
			for k=i+1 to m-1 repeat 
				if b[i][j]>b[k][j] then 
					Set t<-b[i][j]
					Set b[i][j]<-b[k][j]
					Set b[k][j]<-t
				[End of ‘if’]
			[End of ‘for’ loop]
		[End of ‘for’ loop]
	[End of ‘for’ loop]
	[printing the matrix after sorting the columns]
	Print "After sorting the columns in ascending order:"
	for i=0 to m-1 repeat 
		for j=0 to n-1 repeat 
			print b[i][j]
		[End of ‘for’ loop]
		Move to the next line
	[End of ‘for’ loop]
Step 3: Stop.