This document contains the Java code for an insertion sort algorithm. It defines a main method that takes in user input of 5 integer values, stores them in an array, and then sorts the array using insertion sort. It iterates through the array, compares adjacent elements, and swaps them if out of order until the array is fully sorted from lowest to highest value. The sorted array is then printed out at the end.