Implementing Insertion Sort Algorithm in Java Program

package org.code2care.java.sorting.algo;

import java.util.Arrays;

public class InsertionSortJavaExample {

    public static void main(String[] args) {

        //Unsorted Array
        int[] unsortedArray = {4, 99, 2, 11, 34, 67, 54, 12, 45, 245, 234, 12, 200};
        InsertionSortJavaExample insertionSort = new InsertionSortJavaExample();

        int[] sortedArray = insertionSort.insertionSortAlgorithm(unsortedArray);

        System.out.println(Arrays.toString(sortedArray));
    }

    public int[] insertionSortAlgorithm(int[] arrayOfNumbers) {

        int arrayLength = arrayOfNumbers.length;

        for (int i = 1; i < arrayLength; i++) {
            int key = arrayOfNumbers[i];
            int j = i - 1;
            while (j >= 0 && arrayOfNumbers[j] > key) {
                arrayOfNumbers[j + 1] = arrayOfNumbers[j];
                j--;
            }
            arrayOfNumbers[j + 1] = key;
        }

        return arrayOfNumbers;
    }
}

Output:

	Time Complexity
	Best Case	Average Case	Worst Case	Space Complexity
Selection Sort	O(n)	O(n^2)	O(n^2)	O(1)