void
insertion_sort(
int
arr[],
int
length)
...
{
int j;
for(j = 1;j < length;j++)...{
int key = arr[j];
int i=j-1;
while(i >= 0 && arr[i] > key)...{
arr[i+1] = arr[i];
i--;
}
arr[i+1] = key;
}
}
int j;
for(j = 1;j < length;j++)...{
int key = arr[j];
int i=j-1;
while(i >= 0 && arr[i] > key)...{
arr[i+1] = arr[i];
i--;
}
arr[i+1] = key;
}
}