插入排序

#include <stdio.h>

int a1[8] = {4,6,67,34,12,1,6,14};
int a2[8] = {23,3,2,45,22,13,1,25};

void insertion_high_sort(int a[], int len)
{
    int i, j,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_low_sort(int a[], int len)
{
    int i,j,key;
    
    for(i = 1; i < len; i++)
    {
        key = a[i];

	j = i - 1;
	while(j >= 0 && a[j] < key)
	{
	    a[j + 1] = a[j];
	    j--;
	}
	a[j + 1] = key;
    }
}

int main()
{
    insertion_high_sort(a1,8);
    insertion_low_sort(a2,8);
 
    int i;
    for(i = 0; i < 8; i++)
    {
        printf("%d ",a1[i]);
    }
    printf("\n");
    for(i = 0; i < 8; i++)
    {
        printf("%d ",a2[i]);
    }
    return 0;
}