// 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, 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, 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+CiNpbmNsdWRlIDxzdGRsaWIuaD4KCnZvaWQgcHJpbnRBKGludCBhW10sIGludCBuKXsKICAgIGludCBpOwogICAgZm9yKGkgPSAwOyBpIDwgbjsgaSsrKXsKICAgICAgICBwcmludGYoIiVkICIsIGFbaV0pOwogICAgfQogICAgcHJpbnRmKCJcbiIpOwp9Cgp2b2lkIHN3YXAoaW50KiBhLCBpbnQqIGIpewogICAgaW50IHRtcDsKICAgIHRtcCA9ICphOwogICAgKmEgPSAqYjsKICAgICpiID0gdG1wOwp9Cgp2b2lkIEluc2VydGlvblNvcnQoaW50IGFbXSwgaW50IG4pewogICAgaW50IGksIGosIGtleTsKICAgIGZvciAoaSA9IDE7IGkgPCBuOyBpKyspIHsKICAgICAgICBrZXkgPSBhW2ldOyAgICAgIAogICAgICAgIGogPSBpIC0gMTsKCiAgICAgIAogICAgICAgIHdoaWxlIChqID49IDAgJiYgYVtqXSA+IGtleSkgewogICAgICAgICAgICBhW2ogKyAxXSA9IGFbal07CiAgICAgICAgICAgIGotLTsKICAgICAgICB9CgogICAgICAgIGFbaiArIDFdID0ga2V5OwogICAgfQp9CgoKaW50IG1haW4odm9pZCl7CiAgICBpbnQgbiwgaTsKICAgIGludCAqdjsKCiAgIAogICAgc2NhbmYoIiVkIiwgJm4pOwoKICAgCiAgICB2ID0gKGludCopbWFsbG9jKHNpemVvZihpbnQpICogbik7CiAgICBpZiAodiA9PSBOVUxMKSB7CiAgICAgICAgcHJpbnRmKCJFUlJPUlxuIik7CiAgICAgICAgcmV0dXJuIC0xOwogICAgfQoKICAgIGZvciAoaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgICAgICBzY2FuZigiJWQiLCAmdltpXSk7CiAgICB9CgogICAgSW5zZXJ0aW9uU29ydCh2LCBuKTsKCiAgICBwcmludEEodiwgbik7CgogICAgZnJlZSh2KTsKCiAgICByZXR1cm4gMDsKfQo=