// 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(j > 0){
if(a[j - 1] <= a[j]) break;
swap(&a[j - 1], &a[j]);
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+CiAKdm9pZCBwcmludEEoaW50IGFbXSwgaW50IG4pewogICAgaW50IGk7CiAgICBmb3IoaT0wO2k8bjtpKyspewogICAgICAgIHByaW50ZigiJWQgIixhW2ldKTsKICAgIH0KICAgIHByaW50ZigiXG4iKTsKfQogCnZvaWQgc3dhcChpbnQqIGEsIGludCogYil7CiAgICBpbnQgIHRtcDsKICAgIHRtcCA9ICphOwogICAgKmEgPSAqYjsKICAgICpiID0gdG1wOwp9CiAKdm9pZCBJbnNlcnRpb25Tb3J0KGludCBhW10sIGludCBuKXsKICAgIGludCBpLCBqOwoKICAgIGZvcihpID0gMTsgaSA8IG47IGkrKyl7CiAgICAgICAgaiA9IGk7CiAgICAgICAgd2hpbGUoaiA+IDApewogICAgICAgICAgICBpZihhW2ogLSAxXSA8PSBhW2pdKSBicmVhazsKICAgICAgICAgICAgc3dhcCgmYVtqIC0gMV0sICZhW2pdKTsKICAgICAgICAgICAgai0tOwogICAgICAgIH0KICAgIH0KfQogCmludCBtYWluKHZvaWQpewogICAgaW50IG4saTsKICAgIGludCAqdjsKICAgIHNjYW5mKCIlZCIsJm4pOwogICAgdiA9IChpbnQqKW1hbGxvYyhzaXplb2YoaW50KSpuKTsKICAgIGlmKHY9PU5VTEwpewogICAgICAgIHByaW50ZigiRVJST1JcbiIpOwogICAgICAgIHJldHVybiAtMTsKICAgIH0KICAgIGZvcihpPTA7aTxuO2krKyl7CiAgICAgICAgc2NhbmYoIiVkIiwmdltpXSk7CiAgICB9CiAgICBJbnNlcnRpb25Tb3J0KHYsbik7CiAgICBwcmludEEodixuKTsKICAgIGZyZWUodik7CiAgICByZXR1cm4gMDsKfQo=