Method insertionSort

src/main/java/com/thealgorithms/others/BFPRT.java:151–164

Sorts a portion of the array using insertion sort. @param arr the input array @param begin the starting index @param end the ending index

(int[] arr, int begin, int end)

     * @param end the ending index
     */
    public static void insertionSort(int[] arr, int begin, int end) {
        if (arr == null || arr.length < 2) {
            return;
        }
        for (int i = begin + 1; i != end + 1; i++) {
            for (int j = i; j != begin; j--) {
                if (arr[j - 1] > arr[j]) {
                    swap(arr, j - 1, j);
                } else {
                    break;
                }
            }
        }
    }

    /**
     * Swaps two elements in an array.