Insertion sort in Java

This algorithm of "selection sort" really means that you have an outer loop that runs across all objects in the array, and have some process (which is represented by the inner loop) manifest itself on each object. What the inner loop does, is to arrange a series of matches or battles, or comparisons, between the object that you are now dealing with (the one that is currently being served by the outer loop to the inner loop) to the object that came before it. Those matches (or battles or comparisons) will continue as long as the object that we are dealing with continues to loose (and continues to deteriorate and proceed downwards in the array) or until we finished battling against all the objects that were between the object that we are now dealing with and the bottom of the array (index zero). Whenever we stop. at last, that is the spot we will insert our object (the on we are dealing with, as discussed). So previously we had to take into account that we will need an empty spot right there to insert this object (now you see why this sorting type in named "Insertion sort"). What we did is, that we used to push each element to the right, and by doing so we are inadvertently erasing the memory of the object that was there. This action will cause no harm, if we keep the memory of the object on the most right (this is the object that we are now dealing with that was sent by the outer loop to us) in a separate dedicated location, we can call this location with such name as "temporary" or "key" or the like. Then, when we finally know were to insert our object, we have a clear spot designated to it, and we may casually copy the object's information from this temporary location that we used for that aim.