Insertion sort (DSA)

#include<stdio.h>

void insert(int arr[50], int n)
{
for (int i = 1; i < n-1; i++)
{
int j=i ;
int newvalue = arr[i+1];

    while (arr[j] > newvalue && j>=0)
    {
        arr[j+1] = arr[j];
        j--;
    }
    
    arr[j+1] = newvalue;
}

}
int main()
{
int n;
printf("Enter the size of array : ");
scanf("%d", &n);

int arr[50]={0};
for (int i = 0; i < n; i++)
{
    printf("Enter element %d: ", i+1);
    scanf("%d",&arr[i]);
}

insert(arr , n);

printf("\nSorted array is:\n");
for (int i = 0; i < n; i++)
{
    printf("%d\t", arr[i]);
}
return 0;

}