to visualize this insertion processimagine that we store in array entries remote controls representing references to the nonnull gameentry objectslisted left-to-right from the one with highest score to the one with the lowest given the new game entryewe need to figure out where it belongs we start this search at the end of the entries array if the last reference in this array is not null and its score is bigger than ' scorethen we can stop immediately forin this casee is not high score--it doesn' belong in the entries array at all otherwisewe know that belongs in the arrayand we also know that the last thing in the entries array no longer belongs there nextwe go to the second to the last reference in the array if this reference is null or it points to gameentry object whose score is less thane'sthis reference needs to be moved one cell to the right in the entries array moreoverif we move this referencethen we need to repeat this comparison with the next oneprovided we haven' reached the beginning of the entries array we continue comparing and shifting references to game entries until we either reach the beginning of the entries array or we compare ' score with game entry with higher score in either casewe will have identified the place where belongs (see figure figure preparing to add new gameentry object to the entries array in order to make room for the new referencewe have to shift the references to game entries with smaller scores than the new one to the right by one cell