insertSort

static void insertSort2(int* arr, int n) {
    int j, temp;
    for(int i = 1; i < n; i++) {
        temp = arr[i];
        for(j = i - 1; j >= 0; j--) {
            if(temp < arr[j])
                arr[j + 1] = arr[j];
        }
        arr[j + 1] = temp;
    }
}

 #include <stdio.h>
 
static void insertSort2(int *arr, int n) {
    int i, k, j, temp;
    for( i = 1; i < n; i++) {
        temp = arr[i];
        for(j = i - 1; j >= 0 && temp < arr[j]; j--) {
            arr[j + 1] = arr[j];
        }
        arr[j + 1] = temp;
    }
    for (k=0; k<n; k++){
        printf("%d ", arr[k]);
    }
    
}
int main(){
    int arr[]={1,1,2,1,3,2,4,5,6,8,9,10};
    insertSort2(arr, 12);
    return 0;
}