InsertionSortTest.java

import java.util.Arrays;
import java.util.Random;

public class InsertionSortTest {
    public static void main(String[] args) {
        Integer[] easyArray = {1, 2, 3, 4, 5, 6, 7, 8, 9};
        System.out.printf("Original array: %s%n%n", Arrays.toString(easyArray));
        InsertionSort.insertionSort(easyArray);
        System.out.printf("%nSorted array:   %s%n", Arrays.toString(easyArray));
        Integer[] hardArray = {9, 8, 7, 6, 5, 4};
        System.out.printf("Original array: %s%n%n", Arrays.toString(hardArray));
        InsertionSort.insertionSort(hardArray);
        System.out.printf("%nSorted array:   %s%n", Arrays.toString(hardArray));
        Integer[] randomArray = new Integer[9];
        for(int i = 0; i < randomArray.length; i++) {
            Random random = new Random();
            randomArray[i] = random.nextInt(99);
        }
        System.out.printf("Original array: %s%n%n", Arrays.toString(randomArray));
        InsertionSort.insertionSort(randomArray);
        System.out.printf("%nSorted array:   %s%n", Arrays.toString(randomArray));
    }
}