// 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 k,tmp,x=a[1];
for(int i=1;i<n;i++){
x=a[i];
for(k=i;k>0&&a[k-1]>x;k--){
a[k]=a[k-1];
}
a[k]=x;
}
}
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+CiNpbmNsdWRlIDxzdGRsaWIuaD4KCnZvaWQgcHJpbnRBKGludCBhW10sIGludCBuKXsKICAgIGludCBpOwogICAgZm9yKGk9MDtpPG47aSsrKXsKICAgICAgICBwcmludGYoIiVkICIsYVtpXSk7CiAgICB9CiAgICBwcmludGYoIlxuIik7Cn0KCnZvaWQgc3dhcChpbnQqIGEsIGludCogYil7CiAgICBpbnQgIHRtcDsKICAgIHRtcCA9ICphOwogICAgKmEgPSAqYjsKICAgICpiID0gdG1wOwp9Cgp2b2lkIEluc2VydGlvblNvcnQoaW50IGFbXSwgaW50IG4pewoJaW50IGssdG1wLHg9YVsxXTsKCWZvcihpbnQgaT0xO2k8bjtpKyspewoJCXg9YVtpXTsKCQlmb3Ioaz1pO2s+MCYmYVtrLTFdPng7ay0tKXsKCQkJYVtrXT1hW2stMV07CgkJfQoJCWFba109eDsKCX0KfQoKaW50IG1haW4odm9pZCl7CiAgICBpbnQgbixpOwogICAgaW50ICp2OwogICAgc2NhbmYoIiVkIiwmbik7CiAgICB2ID0gKGludCopbWFsbG9jKHNpemVvZihpbnQpKm4pOwogICAgaWYodj09TlVMTCl7CiAgICAgICAgcHJpbnRmKCJFUlJPUlxuIik7CiAgICAgICAgcmV0dXJuIC0xOwogICAgfQogICAgZm9yKGk9MDtpPG47aSsrKXsKICAgICAgICBzY2FuZigiJWQiLCZ2W2ldKTsKICAgIH0KICAgIEluc2VydGlvblNvcnQodixuKTsKICAgIHByaW50QSh2LG4pOwogICAgZnJlZSh2KTsKICAgIHJldHVybiAwOwp9Cg==