insertion sort in java

/**
 * @author lautturi.com
 * Java example: java insertion sort algorithm
 */

import java.util.*;

public class Lautturi {

	public static int[] insertionSort(int[] arr) {
		for (int j = 1; j < arr.length; j++) {
			int key = arr[j];
			int i = j - 1;
			while (i > 0 && arr[i] > key) {
				arr[i + 1] = arr[i];
				i -= 1;
			}
			arr[i + 1] = key;
		}
		return arr;
	}

	public static void main(String[] args) {

		int[] intArray = { 1, 4, 2, 7, 5, 16, 12, 8, 13, 28 };

		System.out.println(Arrays.toString(intArray));
		intArray = insertionSort(intArray);
		System.out.println(Arrays.toString(intArray));
	}
}

output:

[1, 4, 2, 7, 5, 16, 12, 8, 13, 28]
[1, 2, 4, 5, 7, 8, 12, 13, 16, 28]