Java Insertion Sort Algorithm

InsertionSortAlgorithm.java

/**
     * This method will use the insertion sort algorithm to sort an int[] of
     * numbers.
     * 
     * @param numbers
     * 
     * @return int[]
     */
    public static int[] insertionSort(int[] numbers) {
        int n = numbers.length;

        for (int i = 0; i < n; i++) {
            int el = numbers[i];
            int x = i - 1;

            while (x >= 0 && numbers[x] > el) {
                numbers[x + 1] = numbers[x];
                x = x - 1;
            }

            numbers[x + 1] = el;
        }

        return numbers;
    }