矩阵排序，四角最小，中心最大

#include "stdio.h"
#define MAX 25
void swap(int *a,int *b)
{
int t;
t = *a;
*a = *b;
*b = t;
}
void main()
{
int a[MAX];
int temp;
printf("请输入25个数字\n");
for(int k = 0;k < MAX; k++ )
{
scanf("%d",&a[k]);
}

for(int j = 0; j < MAX-1; j++)
{
for(int i = 0; i <MAX - 1 - j;i++)
{
if(a[i]>a[i+ 1])
{
temp = a[i];
a[i] = a[i+1];
a[i+1] = temp;
}
}
}
//int a[25] = {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25};
swap(&a[4],&a[1]);
swap(&a[20],&a[2]);
swap(&a[24],&a[3]);
swap(&a[12],&a[3]);

for(int m = 0;m<MAX;m++)
{
printf("%d\t",a[m]);
if((m+1)%5 == 0)
{
printf("\n");
}
}

}