#include <stdio.h>
void Insertion_Sort(int A[], int len);
int main()
{
int i;
int A[] = {90, 80, 70, 60, 50, 40, 30, 20, 10};
Insertion_Sort(A, 9);
for (i = 0; i < 9; i++)
{
printf("%d ", A[i]);
}
void Insertion_Sort(int A[], int len)
{
int i;
int j;
int key;
for (j = 1; j < len; j++)
{
key = A[j];
i = j - 1;
while (i >= 0 && A[i] > key)
{
A[i+1] = A[i];
i = i - 1;
}
A[i+1] = key;
}
}
void Insertion_Sort(int A[], int len);
int main()
{
int i;
int A[] = {90, 80, 70, 60, 50, 40, 30, 20, 10};
Insertion_Sort(A, 9);
for (i = 0; i < 9; i++)
{
printf("%d ", A[i]);
}
printf("\n");
return 0;
}void Insertion_Sort(int A[], int len)
{
int i;
int j;
int key;
for (j = 1; j < len; j++)
{
key = A[j];
i = j - 1;
while (i >= 0 && A[i] > key)
{
A[i+1] = A[i];
i = i - 1;
}
A[i+1] = key;
}
}