#include <stdio.h>
#include<time.h>
#define N 5
void exchange(int a[][N],int m,int n)
{
int tmp,i;
for(i = 0;i < N;i++)
{
tmp = a[m][i];
a[m][i] = a[n][i];
a[n][i] = tmp;
}
}
int findmin(int a[][N],int m)
{
int min = a[m][0];
int min_i = m;
int i,j;
for(i = m;i < N;i++)
{
for(j = 0;j < N;j++)
{
if(min > a[i][j])
{
min = a[i][j];
min_i = i;
}
}
}
return min_i;
}
int main()
{
int a[N][N];
int i,j;
int min;
srand(time(NULL));
for(i = 0;i < N;i++)
{
for(j = 0;j < N;j++)
{
a[i][j] = rand() % 100;
printf("%3d",a[i][j]);
}
printf("\n");
}
for(i = 0;i < N-1;i++) {
min = findmin(a,i);
exchange(a,i,min);
}
printf("after sort the array are:\n");
for(i = 0;i < N;i++)
{
for(j = 0;j < N;j++)
{
printf("%3d",a[i][j]);
}
printf("\n");
}
return 0;
}
#include<time.h>
#define N 5
void exchange(int a[][N],int m,int n)
{
int tmp,i;
for(i = 0;i < N;i++)
{
tmp = a[m][i];
a[m][i] = a[n][i];
a[n][i] = tmp;
}
}
int findmin(int a[][N],int m)
{
int min = a[m][0];
int min_i = m;
int i,j;
for(i = m;i < N;i++)
{
for(j = 0;j < N;j++)
{
if(min > a[i][j])
{
min = a[i][j];
min_i = i;
}
}
}
return min_i;
}
int main()
{
int a[N][N];
int i,j;
int min;
srand(time(NULL));
for(i = 0;i < N;i++)
{
for(j = 0;j < N;j++)
{
a[i][j] = rand() % 100;
printf("%3d",a[i][j]);
}
printf("\n");
}
for(i = 0;i < N-1;i++) {
min = findmin(a,i);
exchange(a,i,min);
}
printf("after sort the array are:\n");
for(i = 0;i < N;i++)
{
for(j = 0;j < N;j++)
{
printf("%3d",a[i][j]);
}
printf("\n");
}
return 0;
}