void AList::InsertionSort(int& comparisons, int&movements) //Precondition: none
ID: 3617372 • Letter: V
Question
void AList::InsertionSort(int& comparisons, int&movements)
//Precondition: none
//Postcondition: elements have been sorted using Insertion Sortalgorithm
{
comparisons = 0;
movements = 0;
int i;
int hold;
for (int next = 1; next <numberOfElements; next++) {
movements++;
hold =elements[next];
for (i = next-1; i>= 0; i--) {
comparisons++;
if (elements[i] > hold) {
movements++;
elements[i+1] = elements[i];
} else {
break;
}
}
movements++;
elements[i+1] =hold;
}
ordered = true; // KNOWN to be ordered
}