Insertion Sort in Classic Sort

//Increment
void asc_insert_sort(int arr[], int len)
{
int i, j;
for (i=1;i if (arr[i] int temp = arr[i];
for (j=i;arr[j-1]>temp&&j>0;j--){
  arr[j] = arr[j - 1];
      }

     arr[j] = temp;
    }
} }
}

//Decrement
void desc_insert_sort(int arr[], int len)
{
int i, j;
for (i = 1;i < len;i++) {
if (arr[i] > arr[i - 1]) {
int temp = arr[i];
for (j = i;arr[j - 1] < temp && j> 0;j--) {
  arr[j] = arr[j - 1];
      }

     arr[j] = temp;
    }
} }
}