InsertionSort.java

// start at the beginning of the array and iterate through to the second to last item
for (int currentIndex = 0; currentIndex < array.length - 1; currentIndex++)
{
    // assume the currentIndex is the smallest
    int minIndex = currentIndex;
    // set i to be the index immediately proceeding the currentIndex
    for (int i = currentIndex + 1; i < array.length; i++)
    {
        // if true, we found a smaller index
        if (array[i] < array[minIndex])
        {
            // save the index of the smaller item
            minIndex = i;
        }
    }
    // if true, indexes are not the same so we can swap the items
    if (minIndex != currentIndex)
    {
        int temp = array[currentIndex];
        array[currentIndex] = array[minIndex];
        array[minIndex] = temp;
    }
}