Sicily 1154. Easy sort

// Problem#: 1154
// Author#: Reid Chan

#include <iostream>
#include <stdio.h>

using namespace std;

void insertion_sort(int *a, int sz, int n)
{
int i;
for (i = sz - 1; i >= 0 && n < a[i]; --i) {
a[i+1] = a[i];
}
a[i+1] = n;
}

int main() {
int t;
int arr[1001] = { 0 };
cin >> t;
while (t--) {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
scanf("%d", &arr[i]);
insertion_sort(arr, i, arr[i]);
}
for (int i = 0; i < n; ++i) {
printf("%d\n", arr[i]);
}
}
return 0;
}