对N行N列二维数组的每一行排序，偶数行(0当作偶数)由小到大排序，奇数行由大到小排序

最新推荐文章于 2023-01-11 19:24:18 发布

一只会笑的小猪

最新推荐文章于 2023-01-11 19:24:18 发布

阅读量2.3k

点赞数

本文链接：https://blog.csdn.net/a_studycx/article/details/52966850

版权

#include <stdio.h>
#define N 4
int main()
{
int a[N][N] = {{4,2,3,1},{5,7,6,8},{12,10,11,9},{13,15,14,16}};
int i,j,k;
int max,min;
int temp,tmp;
    
//打印数组
for(i = 0;i < N;i++)
{
for(j = 0;j < N;j++)
{
printf("%3d",a[i][j]);
}


printf("\n");
}


    //偶数序列排序输出
for(i = 0;i < N;i += 2)
{
for(j = 0;j < N - 1;j++)
{
for(k = j + 1;k < N;k++)
if(a[i][j] > a[i][k])
   {
temp = a[i][j];
   a[i][j] = a[i][k];
   a[i][k] = temp;
   }
         }
}

    //奇数序列排序输出
for(i = 1;i < N;i += 2)
{
for(j = 0;j < N - 1;j++)
{
for(k = j;k < N;k++)
if(a[i][j] < a[i][k])
   {
tmp = a[i][j];
   a[i][j] = a[i][k];
       a[i][k] = tmp;
   }
}
}


printf("The sorted:\n");


for(i = 0;i < N;i++)
{
for(j = 0;j < N;j++)
{
printf("%3d",a[i][j]);
}


printf("\n");
}
    return 0;
}