Insertion Sort

#include <stdio.h>
#include <stdlib.h>

int main()
{
    int n;
    int i,j,chave;
    int *A;
    printf("Digite o tamanho do vetor:\n");
    scanf("%d",&n);
    A= malloc(n *sizeof(int));
    memset(A,0,n);
    printf("Digite os valores dos numeros:\n");

    for(i=1;i<n;i++)
    {
        scanf("%d",&A[i]);
        chave=A[i];
        j=i-1;
        while(j>0 && A[j]>chave)
        {
            A[j+1]=A[j];
            j--;
        }
        A[j+1]= chave;
    }
    for(i=0;i<n;i++)
    {
        printf("{%d}",A[i]);
    }