Help me in solving DAA030 problem

help
,
1

My issue

failed on hidden test cases

My code

#include <stdio.h>
void insertionSort(int arr[], int n) {
    for (int i = 1; i < n; i++) {  
        int key = arr[i];
        int j = i - 1;
        while (j >= 0 && arr[j] > key) {  
            arr[j + 1] = arr[j];
            j = j - 1;
        }
        arr[j + 1] = key;
    }
}
void printArray(int arr[], int n) {
    for (int i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }
    printf("\n");
}
int main() {
    int arr[] = {3,2,1,4};
    int n = sizeof(arr) / sizeof(arr[0]);

    insertionSort(arr, n);
    printArray(arr, n);

    return 0;
}

Learning course: Design and Analysis of Algorithms
Problem Link: Insertion Sort in Design and Analysis of Algorithms