# How do you write Java insertion sort code?

Here is a simple example of implementing a Java insertion sort algorithm:

```
public class InsertionSort {
public static void insertionSort(int[] arr) {
int n = arr.length;
for (int i = 1; i < n; i++) {
int key = arr[i];
int j = i - 1;
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j];
j--;
}
arr[j + 1] = key;
}
}
public static void main(String[] args) {
int[] arr = {12, 11, 13, 5, 6};
insertionSort(arr);
System.out.println("Sorted array:");
for (int num : arr) {
System.out.print(num + " ");
}
}
}
```

The insertionSort method in the code above implements the insertion sorting algorithm. In the main method, an integer array is created and the insertionSort method is called to sort the array, after which the sorted array is printed.