insertion sort

#include <stdio.h>

void printt(int arr[], int n, int counter) {
    printf("\ncounter = %d\n", counter);
    for (int i =0;i<n;i++)
        printf("\t%d", arr[i]);
    printf("\n");
}

int main() {
    int counter=0, n, temp;
    scanf("%d", &n);
    int arr[n];
    for (int i =0;i<n;i++)
        scanf("%d", &arr[i]);

    for (int i = 1;i<n;i++) {
        temp = arr[i];
        int j = i-1;
        while (j >=0 && temp < arr[j]) {
            arr[j+1] = arr[j];
            counter++;
            j--;
        }
        arr[j+1] = temp;
    }
    printt(arr, n, counter);
    return 0;
}