•The code (Iterative Version):
•
• template <typename Item>
• void insertionsort( Item a[], int left, int right)
• {
• int i, j,
index;
• for (i=1; i < array_size; i++)
• {
• index = numbers[i]; j = i;
• while ((j > 0) && (numbers[j-1] >
index))
• {
• numbers[j] = numbers[j-1]; j = j - 1;
• }
• numbers[j] = index; }
• }
• }