// 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 i, j;
for(i = 1; i < n; i++){
j = i;
while(a[j-1] > a[j]){
swap(&a[j], &a[j-1]);
j--;
}
}
}
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;
}
Ly8gSW5zZXJ0aW9uU29ydAogCiNpbmNsdWRlIDxzdGRpby5oPgojaW5jbHVkZSA8c3RkbGliLmg+CiAKdm9pZCBwcmludEEoaW50IGFbXSwgaW50IG4pewogICAgaW50IGk7CiAgICBmb3IoaT0wO2k8bjtpKyspewogICAgICAgIHByaW50ZigiJWQgIixhW2ldKTsKICAgIH0KICAgIHByaW50ZigiXG4iKTsKfQogCnZvaWQgc3dhcChpbnQqIGEsIGludCogYil7CiAgICBpbnQgIHRtcDsKICAgIHRtcCA9ICphOwogICAgKmEgPSAqYjsKICAgICpiID0gdG1wOwp9CiAKdm9pZCBJbnNlcnRpb25Tb3J0KGludCBhW10sIGludCBuKXsKCS8v44GT44GT44KS5pu444GPCglpbnQgaSwgajsKICAgIGZvcihpID0gMTsgaSA8IG47IGkrKyl7CiAgICAgICAgaiA9IGk7CiAgICAgICAgd2hpbGUoYVtqLTFdID4gYVtqXSl7CiAgICAgICAgICAgIHN3YXAoJmFbal0sICZhW2otMV0pOwogICAgICAgICAgICBqLS07CiAgICAgICAgfQogICAgfQp9CiAKaW50IG1haW4odm9pZCl7CiAgICBpbnQgbixpOwogICAgaW50ICp2OwogICAgc2NhbmYoIiVkIiwmbik7CiAgICB2ID0gKGludCopbWFsbG9jKHNpemVvZihpbnQpKm4pOwogICAgaWYodj09TlVMTCl7CiAgICAgICAgcHJpbnRmKCJFUlJPUlxuIik7CiAgICAgICAgcmV0dXJuIC0xOwogICAgfQogICAgZm9yKGk9MDtpPG47aSsrKXsKICAgICAgICBzY2FuZigiJWQiLCZ2W2ldKTsKICAgIH0KICAgIEluc2VydGlvblNvcnQodixuKTsKICAgIHByaW50QSh2LG4pOwogICAgZnJlZSh2KTsKICAgIHJldHVybiAwOwp9