// 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++)
{
for(j = i; j > 0 && a[j-1] > a[j]; j--)
{
swap(&a[j-1], &a[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+CiAKdm9pZCBwcmludEEoaW50IGFbXSwgaW50IG4pCnsKICAgIGludCBpOwogICAgZm9yKGk9MDtpPG47aSsrKQoJewogICAgICAgIHByaW50ZigiJWQgIixhW2ldKTsKICAgIH0KICAgIHByaW50ZigiXG4iKTsKfQogCnZvaWQgc3dhcChpbnQqIGEsIGludCogYikKewogICAgaW50ICB0bXA7CiAgICB0bXAgPSAqYTsKICAgICphID0gKmI7CiAgICAqYiA9IHRtcDsKfQogCnZvaWQgSW5zZXJ0aW9uU29ydChpbnQgYVtdLCBpbnQgbikKewogICAgaW50IGksIGo7CiAgICBmb3IoaSA9IDE7IGkgPCBuOyBpKyspCgl7CiAgICAgICAgZm9yKGogPSBpOyBqID4gMCAmJiBhW2otMV0gPiBhW2pdOyBqLS0pCgkJewogICAgICAgICAgICBzd2FwKCZhW2otMV0sICZhW2pdKTsKICAgICAgICB9CiAgICB9Cn0KIAppbnQgbWFpbih2b2lkKQp7CiAgICBpbnQgbixpOwogICAgaW50ICp2OwogICAgc2NhbmYoIiVkIiwmbik7CiAgICB2ID0gKGludCopbWFsbG9jKHNpemVvZihpbnQpKm4pOwogICAgaWYodj09TlVMTCkKCXsKICAgICAgICBwcmludGYoIkVSUk9SXG4iKTsKICAgICAgICByZXR1cm4gLTE7CiAgICB9CiAgICBmb3IoaT0wO2k8bjtpKyspCgl7CiAgICAgICAgc2NhbmYoIiVkIiwmdltpXSk7CiAgICB9CiAgICBJbnNlcnRpb25Tb3J0KHYsbik7CiAgICBwcmludEEodixuKTsKICAgIGZyZWUodik7CiAgICByZXR1cm4gMDsKfQ==