#include <stdio.h>
void InsertionSort(int a[], int n){
int i, j, key;
for(i = 1; i < n; i++){
key = a[i];
j = i - 1;
while(j >= 0 && a[j] > key){
a[j + 1] = a[j];
j--;
}
a[j + 1] = key;
}
}
int main(void){
int n;
int i;
int a[100];
for(i = 0; i < n; i++){
}
InsertionSort(a, n);
for(i = 0; i < n; i++){
}
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+Cgp2b2lkIEluc2VydGlvblNvcnQoaW50IGFbXSwgaW50IG4pewogICAgaW50IGksIGosIGtleTsKCiAgICBmb3IoaSA9IDE7IGkgPCBuOyBpKyspewogICAgICAgIGtleSA9IGFbaV07CiAgICAgICAgaiA9IGkgLSAxOwoKICAgICAgICB3aGlsZShqID49IDAgJiYgYVtqXSA+IGtleSl7CiAgICAgICAgICAgIGFbaiArIDFdID0gYVtqXTsKICAgICAgICAgICAgai0tOwogICAgICAgIH0KCiAgICAgICAgYVtqICsgMV0gPSBrZXk7CiAgICB9Cn0KCmludCBtYWluKHZvaWQpewogICAgaW50IG47CiAgICBpbnQgaTsKICAgIGludCBhWzEwMF07CgogICAgc2NhbmYoIiVkIiwgJm4pOwoKICAgIGZvcihpID0gMDsgaSA8IG47IGkrKyl7CiAgICAgICAgc2NhbmYoIiVkIiwgJmFbaV0pOwogICAgfQoKICAgIEluc2VydGlvblNvcnQoYSwgbik7CgogICAgZm9yKGkgPSAwOyBpIDwgbjsgaSsrKXsKICAgICAgICBwcmludGYoIiVkICIsIGFbaV0pOwogICAgfQoKICAgIHByaW50ZigiXG4iKTsKCiAgICByZXR1cm4gMDsKfQ==