X475: Sorting - Insertion Sort

Finish the code to complete the insertion sort method. Each comment denoted with //_________________ is a single line that needs to be filled out.

Examples:

insertionSort({2, 0, 3, 4, 8, 10, 1}) -> {0, 1, 2, 3, 4, 8, 10}

Your Answer:

Answer code

public int[] insertionSort(int[] arr)
{
     //Iterate through each index of the array
     for (int i=1; i<arr.length; ++i)
     {
          //Key value is set to the current index of the outer loop
          int key = arr[i];

          //Index to begin comparisons to key value
          int j = i-1;

          //Iterate backwards through the array
          //Search for a value larger than the key
          while (j>=0 && arr[j] > key)
          {
               //Shift values that do not fit the condition
               //This will make room for the key once we find a place
               //____________________________

               //Decrement j
               //___________________________
          }

          //Using the current value of j, place the key in it's new position
          //______________________________
     }
     return arr;
}

Reset

Next exercise

Feedback

Your feedback will appear here when you check your answer.