public class InsertionSort {
    public static void sort(int[] array) {
        for (int i = 1; i < array.length; i++) {
            for (int n = i; n > 0 && array[n] < array[n - 1]; n--) {
                swap(array, n, n - 1);
            }
        }
    }

    private static void swap(int[] array, int minIndex, int maxIndex) {
        int temp = array[minIndex];
        array[minIndex] = array[maxIndex];
        array[maxIndex] = temp;
    }
}