C#

public int[] InsertReversed(int[] arr)
       {
           for (int h = 1; h < arr.Length; h++)
           {
               int curr = arr[h];
               int v = h - 1;

               for (; v >= 0; v--)
               {
                   if (curr > arr[v])
                       break;
               }

               for (int i = h; i > v+1; i--)
               {
                   arr[i] = arr[i - 1];
               }

               arr[v+1] = curr;
           }
           return arr;
       }