You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
119 lines
1.4 KiB
C
119 lines
1.4 KiB
C
#include <stdio.h>
|
|
|
|
void main () {
|
|
|
|
static int ma[10][10],mb[10][10];
|
|
|
|
int i,j,k,a,m,n;
|
|
|
|
printf ("Enter the order of the matrix \n");
|
|
|
|
scanf ("%d %d", &m,&n);
|
|
|
|
printf ("Enter co-efficients of the matrix \n");
|
|
|
|
for (i=0;i<m;++i) {
|
|
|
|
for (j=0;j<n;++j) {
|
|
|
|
scanf ("%d",&ma[i][j]);
|
|
|
|
mb[i][j] = ma[i][j];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
printf ("The given matrix is \n");
|
|
|
|
for (i=0;i<m;++i) {
|
|
|
|
for (j=0;j<n;++j) {
|
|
|
|
printf (" %d",ma[i][j]);
|
|
|
|
}
|
|
|
|
printf ("\n");
|
|
|
|
}
|
|
|
|
printf ("After arranging rows in ascending order\n");
|
|
|
|
for (i=0;i<m;++i) {
|
|
|
|
for (j=0;j<n;++j) {
|
|
|
|
for (k=(j+1);k<n;++k) {
|
|
|
|
if (ma[i][j] > ma[i][k]) {
|
|
|
|
a = ma[i][j];
|
|
|
|
ma[i][j] = ma[i][k];
|
|
|
|
ma[i][k] = a;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/* End of outer for loop*/
|
|
|
|
for (i=0;i<m;++i) {
|
|
|
|
for (j=0;j<n;++j) {
|
|
|
|
printf (" %d",ma[i][j]);
|
|
|
|
}
|
|
|
|
printf ("\n");
|
|
|
|
}
|
|
|
|
printf ("After arranging the columns in descending order \n");
|
|
|
|
for (j=0;j<n;++j) {
|
|
|
|
for (i=0;i<m;++i) {
|
|
|
|
for (k=i+1;k<m;++k) {
|
|
|
|
if (mb[i][j] < mb[k][j]) {
|
|
|
|
a = mb[i][j];
|
|
|
|
mb[i][j] = mb[k][j];
|
|
|
|
mb[k][j] = a;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/* End of outer for loop*/
|
|
|
|
for (i=0;i<m;++i) {
|
|
|
|
for (j=0;j<n;++j) {
|
|
|
|
printf (" %d",mb[i][j]);
|
|
|
|
}
|
|
|
|
printf ("\n");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/*End of main() */ |