We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Sorting
  4. Insertion Sort - Part 2
  5. Discussions

Insertion Sort - Part 2

  • RodneyShag
     + 6 comments

    Java solution - passes 100% of test cases

    public static void insertionSortPart2(int[] array) {
    for (int i = 1; i < array.length; i++) {
        int j = i;
        int value = array[i];
        while (j >= 1 && array[j-1] > value) {
            array[j] = array[j-1];
            j--;
        }
        array[j] = value;
        printArray(array);
    }
}

    Full solution available in my HackerRank solutions.

    Let me know if you have any questions.