41 lines
No EOL
682 B
C
41 lines
No EOL
682 B
C
int printf(char* format, ...);
|
|
int scanf(char* format, ...);
|
|
|
|
int a[100];
|
|
int n;
|
|
|
|
void swap(int* a, int* b) {
|
|
int t = *a;
|
|
*a = *b;
|
|
*b = t;
|
|
}
|
|
|
|
int* max_element(int a[], int n) {
|
|
int* max = a;
|
|
for (int i = 1; i < n; i++) {
|
|
if (a[i] > *max) {
|
|
max = &a[i];
|
|
}
|
|
}
|
|
return max;
|
|
}
|
|
|
|
void sort(int a[], int n) {
|
|
for (int i = 0; i < n; i++) {
|
|
int* max = max_element(a, n - i);
|
|
swap(max, &a[n - i - 1]);
|
|
}
|
|
}
|
|
|
|
|
|
int main() {
|
|
scanf("%d", &n);
|
|
for (int i = 0; i < n; i++) {
|
|
scanf("%d", &a[i]);
|
|
}
|
|
sort(a, n);
|
|
for (int i = 0; i < n; i++) {
|
|
printf("%d ", a[i]);
|
|
}
|
|
printf("\n");
|
|
} |