选择排序
//
// Created by 29273 on 2022-03-16.
//
#include "bits/stdc++.h"
using namespace std;
int n;
int a[100];
void selectSort() {
for (int i = 1; i < n; ++i) {
int k = i;
for (int j = i + 1; j <= n; ++j) {
if (a[k] > a[j]) k = j;
}
if (k != i) {
swap(a[k], a[i]);
}
}
}
int main() {
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
}
selectSort();
for (int i = 1; i <= n; ++i) {
cout << a[i] << " ";
}
return 0;
}