Insertion Sorting In Java

public class InsertionSort {
public static void main(String arg[]) {
int arr[] = { 25, 17, 31, 13, 2, 34, 26, 82, 22, 30 };
int i, j, k, temp;
System.out.print("Insertion sort.\n");
System.out.print("\nArray before sorting:\n");
for (i = 0; i <= 9; i++)
System.out.print(arr[i] + " ");
for (i = 1; i <= 9; i++) {
for (j = 0; j < i; j++) {
if (arr[j] > arr[i]) {
temp = arr[j];
arr[j] = arr[i];
for (k = i; k > j; k--)
arr[k] = arr[k - 1];
arr[k + 1] = temp;
}
}
}
System.out.print("\n\nArray after sorting:\n");
for (i = 0; i <= 9; i++)
System.out.print(arr[i] + " ");
}
}

OUTPUT :

Insertion sort.

Array before sorting:

25 17 31 13 2 34 26 82 22 30 

Array after sorting:

2 13 17 22 25 26 30 31 34 82