acgo

#include <iostream>

void insertion_sort(int arr[], int n) {
for (int i = 1; i < n; i++) {
int key = arr[i];
int j = i - 1;

    while (j >= 0 && arr[j] > key) {
        arr[j + 1] = arr[j];
        j--;
    }
    arr[j + 1] = key;
}

}

int main() {
int n;
std::cin >> n;
int num[n];

for (int i = 0; i < n; i++) {
    std::cin >> num[i];
}

insertion_sort(num, n);

for (int i = 0; i < n; i++) {
    std::cout << num[i] << ' ';
}

return 0;

}