如何将移位元素功能与插入排序相结合？

Question

I have a question: I was asked to write a function which related to insertion sort. By giving a number the function will shift the next i values to the right, and to notice that the value at the last of the "i values" will get overrun by the previous one. For example: 9,8,7,6,5 and the number is i = 2: will become:9,8,7,7,6 while 5 got overrun.

So far that's the code I wrote:

    public static void shift(int [] arr, int i) {
    if(i < arr.length / 2) {
        for(int j = i + i; j > i; j--) {
            arr[j] = arr[j - 1];
        }
    }

    else {
        for(int j = arr.length - 1; j > i; j--) {
            arr[j] = arr[j - 1];
        }
    }
}

Now I need to combine it with insertion sort and I tried with no success. Can someone help? Thanks.

Answer 1

What I got so far, I could be wrong, in that case please make comment so that I can correct.

public static void shift(int [] arr, int i) 
   {
      if(i <= arr.length-2)  //  when i > (arr.length-2) shifting doesn't make any effect
      {
         int tmp = arr[i+1];    //  tmp will hold the overwritten element for future use. 
         arr[i+1] = arr[i];
      }
   }

Now, do you want to sort it by insertion-sort?