二维数组的排序

#include<stdio.h>int main(void){int i,j,row,col,k,t;int index;int a[20][20];printf("输入数组的行数:");scanf("%d",&row);printf("输入数组的列数:");scanf("%d",&col);for(i=0;i<row;i++)for(j=0;j<col;j++)scanf("%d",&a[i][j]);for(i=0;i<row;i++){ for(j=0;j<col-1;j++) //简单选择排序 { index=j; for(k=j+1;k<col;k++)if(a[i][index]>a[i][k]) //如果比它小，就交换index=k;if(index!=j){ t=a[i][index]; a[i][index]=a[i][j]; a[i][j]=t;} }}for(i=0;i<row;i++){for(j=0;j<col;j++) printf("%-5d",a[i][j]); printf("/n");}return 0;}