// InsertionSort
#include <stdio.h>
#include <stdlib.h>
void printA(int a[], int n){
int i;
for(i=0;i<n;i++){
}
}
void swap(int* a, int* b){
int tmp;
tmp = *a;
*a = *b;
*b = tmp;
}
void InsertionSort(int a[], int n){
//ここを書く
int x,y,z;
for(x = 1; x < n; x++){
z = a[x];
y = x - 1;
while(y >= 0 && a[y] > z){
a[y + 1] = a[y];
y--;
}
a[y + 1] = z;
}
}
int main(void){
int n,i;
int *v;
v
= (int*)malloc(sizeof(int)*n
); if(v==NULL){
return -1;
}
for(i=0;i<n;i++){
}
InsertionSort(v,n);
printA(v,n);
return 0;
}
Ly8gSW5zZXJ0aW9uU29ydAoKI2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlIDxzdGRsaWIuaD4KCnZvaWQgcHJpbnRBKGludCBhW10sIGludCBuKXsKICAgIGludCBpOwogICAgZm9yKGk9MDtpPG47aSsrKXsKICAgICAgICBwcmludGYoIiVkICIsYVtpXSk7CiAgICB9CiAgICBwcmludGYoIlxuIik7Cn0KCnZvaWQgc3dhcChpbnQqIGEsIGludCogYil7CiAgICBpbnQgIHRtcDsKICAgIHRtcCA9ICphOwogICAgKmEgPSAqYjsKICAgICpiID0gdG1wOwp9Cgp2b2lkIEluc2VydGlvblNvcnQoaW50IGFbXSwgaW50IG4pewoJLy/jgZPjgZPjgpLmm7jjgY8KCSBpbnQgeCx5LHo7CgkgZm9yKHggPSAxOyB4IDwgbjsgeCsrKXsKICAgICAgICB6ID0gYVt4XTsgICAgIAogICAgICAgIHkgPSB4IC0gMTsKICAgICAgICB3aGlsZSh5ID49IDAgJiYgYVt5XSA+IHopewogICAgICAgICAgICBhW3kgKyAxXSA9IGFbeV07CiAgICAgICAgICAgIHktLTsKICAgICAgICB9CiAgICAgICAgYVt5ICsgMV0gPSB6OwogICAgfQoJCn0KCmludCBtYWluKHZvaWQpewogICAgaW50IG4saTsKICAgIGludCAqdjsKICAgIHNjYW5mKCIlZCIsJm4pOwogICAgdiA9IChpbnQqKW1hbGxvYyhzaXplb2YoaW50KSpuKTsKICAgIGlmKHY9PU5VTEwpewogICAgICAgIHByaW50ZigiRVJST1JcbiIpOwogICAgICAgIHJldHVybiAtMTsKICAgIH0KICAgIGZvcihpPTA7aTxuO2krKyl7CiAgICAgICAgc2NhbmYoIiVkIiwmdltpXSk7CiAgICB9CiAgICBJbnNlcnRpb25Tb3J0KHYsbik7CiAgICBwcmludEEodixuKTsKICAgIGZyZWUodik7CiAgICByZXR1cm4gMDsKfQo=