#include <stdio.h>
#define N 10
//主元排序,或称选择排序 找到最小值与数组头部值交换,每次排好一个元素位置
//便捷输入 121 45 634 2 46 87 0 23 1 98
int main(){
int a[N];
int temp, min; //存储最小值的下标和最小值
for (int i = 0; i < N; i++)
scanf ("%d", &a[i]);
for (int i = 0; i < N; i++){
min = a[i];
for (int j = i; j < N; j++){
if (a[j] <= min){
min = a[j];
temp = j;
}
}
a[temp] = a[i];
a[i] = min;
for (int k = 0; k < N; k++)
printf ("%d ", a[k]);
printf("\n");
}
return 0;
}