Your task in this exercise is to show the behavior for one iteration of the outer for loop of Insertion Sort. In the array displayed below, the record at position sortPos is highlighted. Insertion Sort has already processed the values to the left of position sortPos, so those elements are sorted.
Perform the next part of Insertion Sort to move the highlighted record to its proper place in the array. To swap two elements, click on the first and then click on the second.
Insert the highlighted element into its proper position in the array using Insertion Sort.
Nothing to the right of position sortPos should be changed.
All elements from position 0 to position sortPos should be in ascending order.